Parameter Ecology for Feedback Vertex Set

doi:10.1109/TST.2014.6867520

Parameter Ecology for Feedback Vertex Set

2014-08-01

25

OA

AI

DOI：10.1109/TST.2014.6867520

原文链接

查看原文

摘要

En 中文

This paper deals with the FEEDBACK VERTEX SET problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles. Due it is theoretical and practical importance, the problem has been the subject of intensive study. Motivated by the parameter ecology program we attempt to classify the parameterized and kernelization complexity of FEEDBACK VERTEX SET for a wide range of parameters. We survey known results and present several new complexity classifications. For example, we prove that FEEDBACK VERTEX SET is fixed-parameter tractable parameterized by the vertex-deletion distance to a chordal graph. We also prove that the problem admits a polynomial kernel when parameterized by the vertex-deletion distance to a pseudo forest, a graph in which every connected component has at most one cycle. In contrast, we prove that a slightly smaller parameterization does not allow for a polynomial kernel unless NP subset of coNP/poly and the polynomial-time hierarchy collapses.

Keyword:

feedback vertex set

parameterized complexity

parameter ecology program

structural parameterizations

kernelization

Parameter Ecology for Feedback Vertex Set

摘要

AI总结

期刊

机构

引用论文