Skip to main content
Article thumbnail
Location of Repository

Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization

By Hans L. Bodlaender, Bart M. P. Jansen and Stefan Kratsch

Abstract

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, both known and new ones, by studying them in the framework of kernelization from parameterized complexity. It is known that the NP-complete problem of determining whether a given graph G has treewidth at most k admits no polynomial-time preprocessing algorithm that reduces any input instance to size polynomial in k, unless NP is in coNP/poly and the polynomial hierarchy collapses to its third level. In this paper we therefore consider structural graph measures larger than treewidth, and determine whether efficient preprocessing can shrink the instance size to a polynomial in such a parameter value. We prove that given an instance (G,k) of treewidth we can efficiently reduce its size to O(fvs(G)^4) vertices, where fvs(G) is the size of a minimum feedback vertex set in G. We can also prove a size reduction to O(vc(G)^3) vertices, where vc(G) is the size of a minimum vertex cover. Phrased in the language of parameterized complexity, we show that Treewidth has a polynomial kernel when parameterized by the size of a given feedback vertex set, and also by the size of a vertex cover. In contrast we show that Treewidth parameterized by the vertex-deletion distance to a single clique, and Weighted Treewidth parameterized by the size of a vertex cover, do not admit polynomial kernelizations unless NP is in coNP/poly.Comment: An extended abstract of this paper appeared in the proceedings of ICALP 2011. This is the full version containing all proofs, along with some improvements to the results of the extended abstract. This paper will appear in the SIAM Journal on Discrete Mathematics. The SIAM version will contain slight improvements to this arXiv version; for example, revised figures and typesettin

Topics: Computer Science - Data Structures and Algorithms, Computer Science - Computational Complexity, F.2.2
Year: 2013
OAI identifier: oai:arXiv.org:1104.4217
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1104.4217 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.