15 search results - page 1 / 3 » Approximating the Crossing Number of Toroidal Graphs |
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
GD
2005
Springer
13 years 10 months ago
2005
Springer
ALGORITHMICA
2011
12 years 11 months 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
2008
Springer
13 years 5 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...