An Efficient Local Search for the Feedback Vertex Set Problem
Inspired by many deadlock detection applications, the feedback vertex set is defined as a set of vertices in an undirected graph, whose removal would result in a graph without cycle.The Feedback Vertex Set Problem, known to be NP-complete, is to search for a feedback vertex set with Apparel the minimal cardinality to benefit the deadlock recovery.T