eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2007-11-28
1
17
10.4230/DagSemProc.07281.5
article
Directed Feedback Vertex Set Problem is FPT
Chen, Jianer
Liu, Yang
Lu, Songiian
To decide if the {sc 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 {sc parameterized
feedback vertex set} in directed graph is fixed-parameter
tractable and give the first FPT algorithm of running time
$O((1.48k)^kn^{O(1)})$ for it. As the {sc feedback arc set}
problem in directed graph can be transformed to a {sc
feedback vertex set} problem in directed graph,
hence we also show that the {sc parameterized feedback arc set}
problem can be solved in time of $O((1.48k)^kn^{O(1)})$.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol07281/DagSemProc.07281.5/DagSemProc.07281.5.pdf
Directed feedback vertex set problem
parameterized algorithm,