• Submit to Algorithms Login Register
• MDPI
• Journals A-Z
• For Authors
• For Editors
• For Librarians
• About
• Open Access Policy

• Abstract
• Full-Text PDF [201 KB]
• Article Versions Notes

• Article Statistics
• Google Scholar
• Order Reprints

• Cite this article
• Export to BibTeX
• Export to EndNote

• [+] on DOAJ
• Zhang, Z
• Ye, A
• Zhou, X
• Shao, Z
• [+] on Google Scholar
• Zhang, Z
• Ye, A
• Zhou, X
• Shao, Z
• [+] on PubMed
• Zhang, Z
• Ye, A
• Zhou, X
• Shao, Z

•  CiteULike
•  Facebook
•  Mendeley
•  Twitter
• More services

Open AccessThis article is

• freely available
• re-usable

Algorithms 2013, 6(4), 726-746; doi:10.3390/a6040726

Article

An Efficient Local Search for the Feedback Vertex Set Problem

Zhiqiang Zhang ^1,2, Ansheng Ye ^1,2,* , Xiaoqing Zhou ^1,2 and Zehui Shao ^1,2

¹ Key Laboratory of Pattern Recognition and Intelligent Information Processing, Shiling, Institutions of Higher Education of Sichuan Province, Chengdu 610106, China ² School of Information Science and Technology, Chengdu University, Chengdu 610106, China

* Author to whom correspondence should be addressed.

Received: 24 June 2013; in revised form: 7 August 2013 / Accepted: 28 October 2013 / Published: 1 November 2013

Download PDF Full-Text [201 KB, Updated Version, uploaded 6 November 2013 17:10 CET]

The original version is still available [197 KB, uploaded 1 November 2013 11:23 CET]

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.

Keywords: feedback vertex set; local search; variable depth search; heuristic

Article Statistics

Citations to this Article

Cite This Article