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

本文主要考虑外的反馈点集并出了一个求外最小顶点赋权反馈点集的线性时间算法。