TREEWIDTH and PATHWIDTH parameterized by the vertex cover number

Mathieu Chapelle,Mathieu Liedloff,Ioan Todinca,Yngve Villanger

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures（2013）

引用 9|浏览0

暂无评分

摘要

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.

查看译文

关键词

Vertex Cover Number,parameterized problem,pathwidth problem,classical graph parameter,input graph,minimum vertex cover,recent polynomial kernel result,separate parameter,vertex cover number

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要