Directed Feedback Vertex Set Problem is FPT
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)})$.
Directed feedback vertex set problem
parameterized algorithm,
1-17
Regular Paper
Jianer
Chen
Jianer Chen
Yang
Liu
Yang Liu
Songiian
Lu
Songiian Lu
10.4230/DagSemProc.07281.5
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode