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.
- Published Version
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.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||13 Jun 2011 14:49|
|Last Modified:||02 Mar 2012 13:01|
|Contributors:||Carrabs, Francesco (Author)
Cerulli, Raffaele (Author)
Gentili, Monica (Author)
Parlato, Gennaro (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||2|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)