Treewidth and Pathwidth parameterized by the vertex cover number

Abstract After the number of vertices, Vertex Cover Number is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the Vertex Cover Number. Here we consider the treewidth and pathwidth problems parameterized by k , the size of a minimum vertex cover of the input graph. We show that the pathwidth and treewidth can be computed in O ∗ ( 3 k ) time. This complements recent polynomial kernel results for treewidth and pathwidth parameterized by the Vertex Cover Number.

[1]  Dimitrios M. Thilikos,et al.  On exact algorithms for treewidth , 2006, TALG.

[2]  Fedor V. Fomin,et al.  Finding Induced Subgraphs via Minimal Triangulations , 2009, STACS.

[3]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[4]  Stefan Kratsch,et al.  Kernel Bounds for Structural Parameterizations of Pathwidth , 2012, SWAT.

[5]  Dimitrios M. Thilikos,et al.  A Note on Exact Algorithms for Vertex Ordering Problems on Graphs , 2012, Theory of Computing Systems.

[6]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[7]  Andreas Björklund,et al.  Fourier meets möbius: fast subset convolution , 2006, STOC '07.

[8]  Pinar Heggernes,et al.  A Parameterized Algorithm for Chordal Sandwich , 2010, CIAC.

[9]  Nancy G. Kinnersley,et al.  The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..

[10]  Michal Pilipczuk,et al.  On Cutwidth Parameterized by Vertex Cover , 2012, Algorithmica.

[11]  Mathieu Liedloff,et al.  Treewidth and Pathwidth parameterized by the vertex cover number , 2013, Discret. Appl. Math..

[12]  Fedor V. Fomin,et al.  Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques , 2014, SWAT.

[13]  Stefan Kratsch,et al.  Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization , 2013, SIAM J. Discret. Math..

[14]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[15]  Hisao Tamaki,et al.  Computing Directed Pathwidth in O(1.89 n ) Time , 2012, IPEC.

[16]  Michael R. Fellows,et al.  Graph Layout Problems Parameterized by Vertex Cover , 2008, ISAAC.

[17]  Andrew Drucker,et al.  New Limits to Classical and Quantum Instance Compression , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[18]  Ge Xia,et al.  Improved upper bounds for vertex cover , 2010, Theor. Comput. Sci..

[19]  Yasuaki Kobayashi.  Computing the pathwidth of directed graphs with small vertex cover , 2015, Inf. Process. Lett..

[20]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[21]  Bart M. P. Jansen.  On Sparsification for Computing Treewidth , 2013, IPEC.