The corresponding NP optimization problem of finding the size of a minimum feedback vertex set can be solved in time "O" (1.7548 "n"), where "n" is the number of vertices in the graph.
The corresponding NP optimization problem of finding the size of a minimum feedback vertex set is APX-complete. It can be solved in time "O" (1.7548 "n"), where "n" is the number of vertices in the graph.