DAGSTUHL
2007
14 years 27 days ago
2007
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open problem. In this paper, we prove that the paramet...
WADS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
ICALP
2005
Springer
14 years 5 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
WADS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
IWOCA
2009
Springer
14 years 6 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...