Minimum Weighted Feedback Vertex Set on Diamonds

Carrabs, Francesco, Cerulli, Raffaele, Gentili, Monica and Parlato, Gennaro (2004) Minimum Weighted Feedback Vertex Set on Diamonds Electronic Notes in Discrete Mathematics, 17, pp. 87-91. (doi:10.1016/j.endm.2004.09.001).


[img] PDF 1-s2.0-S1571065304010194-main.pdf - Other
Download (175kB)


Given a vertex weighted graph G, a minimum Weighted Feedback Vertex Set (MWFVS) is a subset F ? V of vertices of minimum weight such that each cycle in G contains at least one vertex in F. The MWFVS on general graph is known to be NP-hard. In this paper we introduce a new class of graphs, namely the diamond graphs, and give a linear time algorithm to solve MWFVS on it. We will discuss, moreover, how this result could be used to effectively improve the approximated solution of any known heuristic to solve MWFVS on a general graph.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/j.endm.2004.09.001
ISSNs: 1571-0653 (print)
Organisations: Electronic & Software Systems
ePrint ID: 370687
Date :
Date Event
Date Deposited: 03 Nov 2014 10:00
Last Modified: 17 Apr 2017 07:07
Further Information:Google Scholar

Actions (login required)

View Item View Item