The University of Southampton
University of Southampton Institutional Repository

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).

Record type: Article


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.

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

More information

Published date: 2004
Organisations: Electronic & Software Systems


Local EPrints ID: 370687
ISSN: 1571-0653
PURE UUID: 8302bb2e-bf9f-4ae8-979b-7a7212bb4f7b

Catalogue record

Date deposited: 03 Nov 2014 10:00
Last modified: 17 Jul 2017 21:49

Export record



Author: Francesco Carrabs
Author: Raffaele Cerulli
Author: Monica Gentili
Author: Gennaro Parlato

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.