Sciweavers

ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Approximating the Crossing Number of Toroidal Graphs
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...
Petr Hlinený, Gelasio Salazar