1101 search results - page 3 / 221 » An Algorithm for the Graph Crossing Number Problem |
STOC
2001
ACM
14 years 6 months ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
GD
2006
Springer
13 years 10 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
COCOA
2007
Springer
14 years 14 days ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
MFCS
2004
Springer
13 years 11 months ago
2004
Springer
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...
ESA
2008
Springer
13 years 8 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...