discrete-time algorithm的用法和樣例：
例句
- In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.
本文主要考慮外平面圖中的反饋點(diǎn)集并給出了一個(gè)求外平面圖最小頂點(diǎn)賦權反饋點(diǎn)集的線(xiàn)性時(shí)間算法。 - Following some properties of the optimal scheduling, a polynomial algorithm is proposed.
給出了最優(yōu)排序的一些性質(zhì)，提出一個(gè)多項式時(shí)間算法。
