592 search results - page 1 / 119 » Crossing numbers of random graphs |
RSA
2002
13 years 5 months ago
2002
DCG
2008
13 years 5 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
ENDM
2008
13 years 5 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
ALGORITHMICA
2011
13 years 10 days ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
GD
2006
Springer
13 years 9 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...