Computing crossing numbers in quadratic time

Authors:
Martin Grohe
Affiliations:
Laboratory for Foundations of Computer Science, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK
Venue:
Journal of Computer and System Sciences - STOC 2001
Year:
2004

Citing 14
Cited 14

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)
The graph genus problem is NP-complete

Journal of Algorithms
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Embedding graphs in an arbitrary surface in linear time

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
A simpler proof of the excluded minor theorem for higher surfaces

Journal of Combinatorial Theory Series B
The expression of graph properties and graph transformations in monadic second-order logic

Handbook of graph grammars and computing by graph transformation
Efficient Planarity Testing

Journal of the ACM (JACM)
The monadic second-order logic of graphs XII: planar graphs and planar maps

Theoretical Computer Science
Query evaluation via tree-decompositions

Journal of the ACM (JACM)
On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Parameterized Complexity

Parameterized Complexity

Crossing number is hard for cubic graphs

Journal of Combinatorial Theory Series B
A Practical Approach to Courcelle's Theorem

Electronic Notes in Theoretical Computer Science (ENTCS)
On the crossing number of almost planar graphs

GD'06 Proceedings of the 14th international conference on Graph drawing
Obtaining a planar graph by vertex deletion

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Approximating the crossing number of toroidal graphs

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating the crossing number of graphs embeddable in any orientable surface

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Removing Independently Even Crossings

SIAM Journal on Discrete Mathematics
An algorithm for the graph crossing number problem

Proceedings of the forty-third annual ACM symposium on Theory of computing
On graph crossing number and edge planarization

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
FPT suspects and tough customers: open problems of downey and fellows

The Multivariate Algorithmic Revolution and Beyond
Polynomial time and parameterized approximation algorithms for boxicity

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
MSOL restricted contractibility to planar graphs

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that for every fixed k ≥ 0 there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and, if this is the case, computes a drawing of the graph into the plane with at most k crossings.