973 search results - page 3 / 195 » New Bounds on Crossing Numbers |
JGAA
1998
13 years 4 months ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
ENDM
2008
13 years 5 months ago
2008
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
DCG
2010
13 years 5 months ago
2010
GD
2008
Springer
13 years 6 months ago
2008
Springer
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 di...