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

本要考虑外平面图中的点集并出了一个求外平面图最小顶点赋权点集的线性时间算法。