In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.
本文主要考虑外图中馈点集并给出了一个求外图最小顶点赋权馈点集线性时间算法。
In this paper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.
本文主要考虑外图中馈点集并给出了一个求外图最小顶点赋权馈点集线性时间算法。
声明:以上例句、词性分类均由互联网资源自动生成,部分未经过人工,表达内容亦不代表本软件观点;若发现问题,欢迎向我们指正。