Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.endm.2004.09.001 | Electronic Notes in Discrete Mathematics |
Keywords | DocType | Volume |
Feedback Vertex Set,Dynamic Programming,Diamond Graphs | Conference | 17 |
ISSN | Citations | PageRank |
1571-0653 | 1 | 0.36 |
References | Authors | |
2 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| F. Carrabs | 1 | 6 | 1.14 |
| R. Cerulli | 2 | 252 | 23.85 |
| M. Gentili | 3 | 32 | 3.35 |
| G. Parlato | 4 | 6 | 1.49 |