Contraction obstructions for treewidth

Authors:
Fedor V. Fomin;Petr Golovach;Dimitrios M. Thilikos
Affiliations:
Department of Informatics, University of Bergen, N-5020 Bergen, Norway;School of Engineering and Computing Sciences, Durham University, United Kingdom;Department of Mathematics, National & Kapodistrian University of Athens, Panepistimioupolis, GR-15784, Athens, Greece
Venue:
Journal of Combinatorial Theory Series B
Year:
2011

Citing 20
Cited 4

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
A simpler proof of the excluded minor theorem for higher surfaces

Journal of Combinatorial Theory Series B
Highly connected sets and the excluded grid theorem

Journal of Combinatorial Theory Series B
Graph minors. XVI. excluding a non-planar graph

Journal of Combinatorial Theory Series B
Embedding grids in surfaces

European Journal of Combinatorics - Special issue: Topological graph theory
Bidimensional Parameters and Local Treewidth

SIAM Journal on Discrete Mathematics
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Journal of the ACM (JACM)
The Bidimensional Theory of Bounded-Genus Graphs

SIAM Journal on Discrete Mathematics
Linearity of grid minors in treewidth with applications through bidimensionality

Combinatorica
Improved Approximation Algorithms for Minimum Weight Vertex Separators

SIAM Journal on Computing
(Meta) Kernelization

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Bidimensionality and kernels

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for domination search

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Bidimensionality and EPTAS

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On graph contractions and induced minors

Discrete Applied Mathematics
The Bidimensionality Theory and Its Algorithmic Applications 1

The Computer Journal

Parameterizing cut sets in a graph by the number of their components

Theoretical Computer Science
Linear kernels for (connected) dominating set on H-minor-free graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide two parameterized graphs @C"k, @P"k with the following property: for every positive integer k, there is a constant c"k such that every graph G with treewidth at least c"k, contains one of K"k, @C"k, @P"k as a contraction, where K"k is a complete graph on k vertices. These three parameterized graphs can be seen as ''obstruction patterns'' for the treewidth with respect to the contraction partial ordering. We also present some refinements of this result along with their algorithmic consequences.