Approximating the Crossing Number of Toroidal Graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F07%3A00020423" target="_blank" >RIV/00216224:14330/07:00020423 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

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
Aproximace průsečíkového čísla toroidálních grafů
Czech description
Dokážeme polynomiální aproximační algoritmus pro výpočet průsečíkového čísla toroidálních grafů s omezeným stupněm.

Project
<a href="/en/project/GA201%2F05%2F0050" target="_blank" >GA201/05/0050: Structural properties and algorithmic complexity of discrete problems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
International Symposium on Algorithms and Computation (ISAAC 2007)
ISBN
978-3-540-77118-0
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
148
Publisher name
Springer Verlag
Place of publication
Berlin
Event location
Sendai, Japan
Event date
Dec 17, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)