TREEWIDTH and PATHWIDTH parameterized by the vertex cover number

Authors:
Mathieu Chapelle;Mathieu Liedloff;Ioan Todinca;Yngve Villanger
Affiliations:
IGM-LabInfo, Universit Paris-Est Marne-la-Vallée, Marne la Vallée cedex 2, France;LIFO, Université d'Orléans, Orléans Cedex 2, France;LIFO, Université d'Orléans, Orléans Cedex 2, France;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Year:
2013

Citing 13
Cited 0

A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Treewidth: Algorithmoc Techniques and Results

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Fourier meets möbius: fast subset convolution

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On exact algorithms for treewidth

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Graph Layout Problems Parameterized by Vertex Cover

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Improved upper bounds for vertex cover

Theoretical Computer Science
Exact Exponential Algorithms

Exact Exponential Algorithms
Preprocessing for treewidth: a combinatorial analysis through kernelization

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
A parameterized algorithm for chordal sandwich

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
On cutwidth parameterized by vertex cover

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernel bounds for structural parameterizations of pathwidth

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Computing directed pathwidth in O(1.89n) time

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
New Limits to Classical and Quantum Instance Compression

FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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*(3k) time. This complements recent polynomial kernel results for treewidth and pathwidth parameterized by the Vertex Cover Number.