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. 本文主要考慮外平面圖中的反饋點集並給出了一個求外平面圖最小頂點賦權反饋點集的線性時間演算法。