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.

• Type: Conference
• Year: 2001
• Where: STOC
• Authors: Martin Grohe
• Keywords: Algorithms, Quadratic Time Algorithm, STOC 2001