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 pape...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2005.
|
| Subjects: | |
| Online Access: | Get fulltext |