A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds


Carrabs, Francesco, Cerulli, Raffaele, Gentili, Monica and Parlato, Gennaro (2005) A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. Inf. Process. Lett., 94, (1), 29-35.

Download

[img] PDF - Published Version
Download (117Kb)

Description/Abstract

Given an undirected and vertex weighted graph G, the Weighted Feedback Vertex Problem (WFVP) consists in finding a subset Fsubset of or equal toV of vertices of minimum weight such that each cycle in G contains at least one vertex in F. The WFVP on general graphs 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 WFVP on it.

Item Type: Article
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 272467
Date Deposited: 13 Jun 2011 14:49
Last Modified: 27 Mar 2014 20:18
Further Information:Google Scholar
ISI Citation Count:2
URI: http://eprints.soton.ac.uk/id/eprint/272467

Actions (login required)

View Item View Item

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