Next Article in Journal
Multi-Core Parallel Gradual Pattern Mining Based on Multi-Precision Fuzzy Orderings
Previous Article in Journal
New Parallel Sparse Direct Solvers for Multicore Architectures
Algorithms 2013, 6(4), 726-746; doi:10.3390/a6040726

An Efficient Local Search for the Feedback Vertex Set Problem

1,2,* , 1,2
1 Key Laboratory of Pattern Recognition and Intelligent Information Processing, Shiling, Institutions of Higher Education of Sichuan Province, Chengdu 610106, China 2 School of Information Science and Technology, Chengdu University, Chengdu 610106, China
* Author to whom correspondence should be addressed.
Received: 24 June 2013 / Revised: 7 August 2013 / Accepted: 28 October 2013 / Published: 1 November 2013
View Full-Text   |   Download PDF [201 KB, 6 November 2013; original version 1 November 2013]   |   Browse Figures


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.
Keywords: feedback vertex set; local search; variable depth search; heuristic feedback vertex set; local search; variable depth search; heuristic
This is an open access article distributed under the Creative Commons Attribution License (CC BY) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote |
MDPI and ACS Style

Zhang, Z.; Ye, A.; Zhou, X.; Shao, Z. An Efficient Local Search for the Feedback Vertex Set Problem. Algorithms 2013, 6, 726-746.

View more citation formats

Related Articles

Article Metrics

For more information on the journal, click here


[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert