779 search results - page 20 / 156 » A graph polynomial for independent sets of bipartite graphs |
HCI
2009
14 years 7 months ago
2009
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
JGAA
2008
14 years 9 months ago
2008
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...