A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs
2004
A feedback vertex set is a subset of vertices in a graph, whose deletion from the graph makes the resulting graph acyclic. In this paper, we study the minimum-weight feedback vertex set problem in series- parallel graphs and present a linear-time exact algorithm to solve it.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
11
References
0
Citations
NaN
KQI