A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds
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.
29-35
Carrabs, Francesco
8307d568-a1b9-4242-8f6d-adc36030775f
Cerulli, Raffaele
a2108ced-4bd4-48a9-9c1a-03464a9bbdc2
Gentili, Monica
10623d29-eb88-4791-afa3-927640edd544
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
2005
Carrabs, Francesco
8307d568-a1b9-4242-8f6d-adc36030775f
Cerulli, Raffaele
a2108ced-4bd4-48a9-9c1a-03464a9bbdc2
Gentili, Monica
10623d29-eb88-4791-afa3-927640edd544
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
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), .
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.
Text
sdarticle(1).pdf
- Version of Record
More information
Published date: 2005
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 272467
URI: http://eprints.soton.ac.uk/id/eprint/272467
PURE UUID: 9a84fddc-c383-4505-99c0-03f4410afe17
Catalogue record
Date deposited: 13 Jun 2011 14:49
Last modified: 14 Mar 2024 10:02
Export record
Contributors
Author:
Francesco Carrabs
Author:
Raffaele Cerulli
Author:
Monica Gentili
Author:
Gennaro Parlato
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