Abstract: 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 the minimal cardinality to benefit the deadlock recovery. To address the issue, this paper presents NewkLS FVS(LS, local search; FVS, feedback vertex set), a variable depth-based local search algorithm with a randomized scheme to optimize the efficiency and performance. Experimental simulations are conducted to compare the algorithm with recent metaheuristics, and the computational results show that the proposed algorithm can outperform the other state-of-art algorithms and generate satisfactory solutions for most DIMACSbenchmarks.
The second algorithm is the k-opt Local Search Algorithm with a Randomized Scheme for the Feedback Vertex Set (NewkLS_FVS) REF , which mainly focuses on the FVSP in the undirected graph.
An Efficient Local Search for the Feedback Vertex Set Problem
Algorithms
Algorithms
Mathematics Computer Science