Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

@inproceedings{Bodlaender2011PreprocessingFT,
  title={Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization},
  author={Hans L. Bodlaender and Bart M. P. Jansen and Stefan Kratsch},
  booktitle={SIAM Journal on Discrete Mathematics},
  year={2011}
}
The notion of treewidth plays an important role in theoretical and practical studies of graph problems. It has been recognized that, especially in practical environments, when computing the treewidth of a graph it is invaluable to first apply an array of preprocessing rules that simplify and shrink it. This work seeks to prove rigorous performance guarantees for such preprocessing rules---known rules as well as more recent ones---by studying them in the framework of kernelization from… 

Kernelization, Preprocessing for Treewidth

This work undertakes a theoretical study of preprocessing for the NP-hard TREEWIDTH problem of finding a tree decomposition of width at most k for a given graph G, and studies upper and lower bounds within the framework of kernelization from parameterized complexity.

Kernel Bounds for Structural Parameterizations of Pathwidth

The main result is that, unless NP ⊆ coNP/poly, Pathwidth admits no polynomial kernelization even when parameterized by the vertex deletion distance to a clique, by giving a cross-composition from Cutwidth.

The Power of Data Reduction : Kernels for Fundamental Graph Problems

The concept of kernelization, developed within the field of parameterized complexity theory, is used to give a mathematical analysis of the power of data reduction for dealing with fundamental NP-hard graph problems and it is proved that Treewidth and Pathwidth do not admit polynomial kernels parameterized by the vertex-deletion distance to a clique, unless thePolynomial hierarchy collapses.

Kernelization Rules for Special Treewidth and Spaghetti Treewidth

It is shown that Special Treewidth has a kernel with O(`) vertices, where ` denotes the size of a vertex cover, which implies that given an instance (G, k) of SpecialTreewidth the authors can efficiently reduce its size to O((`∗)3) verticing.

FPT is characterized by useful obstruction sets: Connecting algorithms, kernels, and quasi-orders

This work shows how exponential-size minor-minimal obstructions for pathwidth k form the crucial ingredient in a novel or-cross-compositions for k-Pathwidth, complementing the trivial and-composition that is known for this problem.

Kernelization Rules for Special Treewidth and Spaghetti Treewidth

It is shown that Special Treewidth has a kernel with O ( ( cid:96) 3 ) vertices, where (cid: 96) denotes the size of a vertex cover, which implies that given an instance ( G, k) of SpecialTreewidth the authors can efficiently reduce its size to O (( (cide:96):96) ∗ ) 3) vertices.

Representative Sets and Irrelevant Vertices: New Tools for Kernelization

This work applies the representative sets tool to the problem of finding irrelevant vertices in graph cut problems, that is, vertices which can be made undeletable without affecting the status of the problem, and gives the first significant progress towards a polynomial kernel for the Multiway Cut problem.

Kernelization of packing problems

This work shows lower bounds for the kernelization of d-Set Matching and other packing problems, and applies this scheme to the vertex cover problem, which allows us to replace the number-theoretical construction by Dell and Van Melkebeek with shorter elementary arguments.

Recent developments in kernelization: A survey

This survey gives a general introduction to the area of kernelization and discusses some recent developments, and attempts a reasonably self-contained update and introduction on the following topics: Lower bounds for kernelization, taking into account the recent progress on the and-conjecture.

On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal

The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of OCT with respect
...

References

SHOWING 1-10 OF 52 REFERENCES

Kernel Bounds for Structural Parameterizations of Pathwidth

The main result is that, unless NP ⊆ coNP/poly, Pathwidth admits no polynomial kernelization even when parameterized by the vertex deletion distance to a clique, by giving a cross-composition from Cutwidth.

Data reduction for graph coloring problems

Complexity of finding embeddings in a k -tree

This work determines the complexity status of two problems related to finding the smallest number k such that a given graph is a partial k-tree and presents an algorithm with polynomially bounded (but exponential in k) worst case time complexity.

New Lower and Upper Bounds for Graph Treewidth

New lower and upper bounds for the treewidth are proposed and tested on the well known DIMACS benchmark for graph coloring, and the heuristic method computes good bounds within a very small computing time.

A linear time algorithm for finding tree-decompositions of small treewidth

Every minor-closed class of graphs that does not contain all planar graphs has a linear time recognition algorithm that determines whether the treewidth of G is at most k, and if so, finds a treedecomposition of G withtreewidth at mostK.

On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal

The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of OCT with respect

Heuristic and metaheuristic methods for computing graph treewidth

This paper proposes two new methods for computing the treewidth of graphs: a heuristic and a metaheuristic, which returns good results in a short computation time, and identifies properties of the triangulation process to optimize the computing time of the method.

On exact algorithms for treewidth

Experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential-time algorithms using exponential space or using only polynomial space are given and it is shown that with a more complicated algorithm using balanced separators, Treewidth can be computed in O*(2.9512n) time and polynometric space.

Cross-Composition: A New Technique for Kernelization Lower Bounds

It is shown that if an NP-hard problem cross-composes into a parameterized problem Q then Q does not admit a polynomial kernel unless thePolynomial hierarchy collapses, and its applicability is shown by proving kernelization lower bounds for a number of important graphs problems with structural (non-standard) parameterizations.

Contraction and Treewidth Lower Bounds

It is shown that the problem to compute the contraction degeneracy is NP-hard, but for fixed k, it is polynomial time decidable if a given graph G has contraction degenerate at least k.
...