A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex s...A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.展开更多
文摘A subset of the vertex set of a graph is a feedback vertex set of the graph ifthe resulting graph is a forest after removing the vertex subset from the graph.In thispaper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.
