An Efficient Local Search for the Feedback Vertex Set Problem

An Efficient Local Search for the Feedback Vertex Set Problem

Blog Article

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 12n/1200 wella 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 click here the computational results show that the proposed algorithm can outperform the other state-of-art algorithms and generate satisfactory solutions for most DIMACSbenchmarks.