a fixed-parameter algorithm for the directed feedback vertex set problem
The (parameterized) feedback vertex set problem on directed graphs, which we refer to as the dfvs problem, is defined as follows: given a directed graph G and a parameter k, either construct a feedback vertex set of at most k vertices in G or report that no such set exists. Whether or not the dfvs problem is fixed-parameter tractable has been a well-known open problem in parameterized computation and complexity, i.e., whether the problem can be solved in time f(k)n O(1) for some function f. In this paper we develop new algorithmic techniques that result in an algorithm with running time 4 k k! n O(1) for the dfvs problem, thus showing that this problem is fixed-parameter tractable.
feedback vertex set parameterized computation deadlock