eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-02-09
21:1
21:16
10.4230/LIPIcs.IPEC.2016.21
article
Structural Parameterizations of Feedback Vertex Set
Majumdar, Diptapriyo
A feedback vertex set in an undirected graph is a subset of vertices whose removal results in an acyclic graph. It is well-known that the problem of finding a minimum sized (or k sized in case of decision version of) feedback vertex set (FVS) is polynomial time solvable in (sub)-cubic graphs, in pseudo-forests (graphs where each component has at most one cycle) and mock-forests (graph where each vertex is part of at most one cycle). In general graphs, it is known that the problem is NP-Complete, and has an O*((3.619)^k) fixed-parameter algorithm and an O(k^2) kernel where k, the solution size is the parameter. We consider the parameterized and kernelization complexity of feedback vertex set where the parameter is the size of some structure of the input. In particular, we show that
* FVS is fixed-parameter tractable, but is unlikely to have polynomial sized kernel when parameterized by the number of vertices of the graph whose degree is at least 4. This answers a question asked in an earlier paper.
* When parameterized by k, the number of vertices, whose deletion results in a pseudo-forest, we give an O(k^6) vertices kernel improving from the previously known O(k^{10}) bound.
* When parameterized by the number k of vertices, whose deletion results in a mock-d-forest, we give a kernel consisting of O(k^{3d+3}) vertices and prove a lower bound of Omega(k^{d+2}) vertices (under complexity theoretic assumptions). Mock-d-forest for a constant d is a mock-forest where each component has at most d cycles.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol063-ipec2016/LIPIcs.IPEC.2016.21/LIPIcs.IPEC.2016.21.pdf
Parameterized Complexity
Kernelization
Feedback Vertex Set
Structural Parameterization