Obtaining planarity by contracting few edges

Authors:
Petr A. Golovach;Pim van 't Hof;Daniël Paulusma
Affiliations:
Department of Informatics, University of Bergen, Norway;Department of Informatics, University of Bergen, Norway;School of Engineering and Computing Sciences, Durham University, UK
Venue:
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Year:
2012

Citing 12
Cited 2

The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Computing crossing number in linear time

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Planarity Allowing Few Error Vertices in Linear Time

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Contractions of planar graphs in polynomial time

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+) time

Theoretical Computer Science
Graph Minors. XXII. Irrelevant vertices in linkage problems

Journal of Combinatorial Theory Series B
Obtaining a Planar Graph by Vertex Deletion

Algorithmica
Contracting graphs to paths and trees

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Increasing the minimum degree of a graph by contractions

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation

Obtaining planarity by contracting few edges

Theoretical Computer Science
A faster FPT algorithm for Bipartite Contraction

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.