The University of Southampton
University of Southampton Institutional Repository

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

Record type: Article

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.

PDF sdarticle(1).pdf - Version of Record
Download (120kB)

Citation

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), pp. 29-35.

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: 18 Jul 2017 06:24

Export record

Contributors

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.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

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.

×