期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A POLYNOMIAL ALGORITHM FOR FINDING THEMINIMUM FEEDBACK VERTEX SET OF A3-REGULAR SIMPLE GRAPH 被引量:2
1
作者 李德明 刘彦佩 《Acta Mathematica Scientia》 SCIE CSCD 1999年第4期375-381,共7页
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vert... A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vertex set of a 3-regular simple graph is provided. 展开更多
关键词 maximum genus nonseparating independent number feedback vertex set 3-regular graph adjacency matching
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部