Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

ISAAC
2007
Springer

favoriteEmaildiscussreport

124views Algorithms» more ISAAC 2007»

Approximating the Crossing Number of Toroidal Graphs

13 years 10 months ago

Approximating the Crossing Number of Toroidal Graphs

Download www.fi.muni.cz

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 constant approximation algorithm is known for this NP-complete problem. We prove that a natural approach to planar drawing of toroidal graphs (used already by Pach and T´oth in [20]) gives a polynomial time constant approximation algorithm for the crossing number of toroidal graphs with bounded degree. In this proof we present a new “grid” theorem on toroidal graphs.

Petr Hlinený, Gelasio Salazar

Real-time Traffic

Constant Approximation Algorithm | ISAAC 2007 | Time Constant Approximation | Toroidal Graphs |

claim paper

Related Content

» Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface

» Crossing Number of Toroidal Graphs

» Crossing Number and Weighted Crossing Number of NearPlanar Graphs

» Crossing and Weighted Crossing Number of NearPlanar Graphs

» Crossing Numbers of Graphs with Rotation Systems

» Random Bichromatic Matchings

» Crossing Minimization in Weighted Bipartite Graphs

» On the Crossing Spanning Tree Problem

» CrossMonotonic Multicast

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ISAAC
Authors	Petr Hlinený, Gelasio Salazar

Comments (0)