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

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