Approximating the Crossing Number of Toroidal Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F07%3A00014964" target="_blank" >RIV/61989100:27240/07:00014964 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Approximating the Crossing Number of Toroidal Graphs
Original language description
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 anatural approach to planar drawing of toroidal graphs (used already by Pach and T'oth) 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.
Czech name
Approximating the Crossing Number of Toroidal Graphs
Czech description
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 anatural approach to planar drawing of toroidal graphs (used already by Pach and T'oth) 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.
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science
ISBN
978-3-540-72585-5
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
148-159
Publisher name
Springer
Place of publication
Atheny
Event location
—
Event date
—
Type of event by nationality
—
UT code for WoS article
—