Sciweavers

4
Voted
STOC
2001
ACM

Computing crossing numbers in quadratic time

14 years 2 months ago
Computing crossing numbers in quadratic time
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 the graph into the plane with at most crossings.
Martin Grohe
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2001
Where STOC
Authors Martin Grohe
Comments (0)