119 search results - page 8 / 24 » Crossing numbers of imbalanced graphs |
GD
2009
Springer
13 years 11 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
ENDM
2008
13 years 7 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
COMBINATORICS
2006
13 years 7 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
WALCOM
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...