This will come swiftly and will not be measured in linear time. 这将很快来到而将不会在线性时间里被测量。
In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it. 本文主要考虑外平面图中的反馈点集并给出了一个求外平面图最小顶点赋权反馈点集的线性时间算法。