nodal set的用法和樣例：
例句
- 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í)間算法。 - The third part is to proof theimpaction set is finite.Comparing Hamiltonian systems without impacts, we should use a technical codition.
相對于沒(méi)有碰撞的哈密頓系統而言，我們?yōu)榱俗C明碰撞點(diǎn)集是有限集而加入了一些技術(shù)性條件。
