Is feedback vertex set problem is solvable in polynomial time for some special graph
Posted by Prabu , at cstheory.stackexchange.com,
Feedback vertex set (FVS) problem is NP-complete for both undirected and directed graphs, and it is NP-complete even for…