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.
本文主要考虑图中的馈点集并给出了一个求图最小顶点赋权馈点集的线性时间算法。
声明:以上例句、词性分类均由互联自动生成,部分未经过人工审核,其表达内容亦不代表本软件的观点;若发现问题,欢迎向我们指正。