In this paper, we study the minimum-weight feedback vertex set problem in seriesparallel graphs and present a linear-time exact algorithm to solve it.

• 文章摘要: A feedback vertex set is a subset of vertices in a graph； whose deletion from the graph makes the resulting graph acyclic.