A POLYNOMIAL ALGORITHM FOR FINDING THEMINIMUM FEEDBACK VERTEX SET OF A3-REGULAR SIMPLE GRAPH 被引量：2

A POLYNOMIAL ALGORITHM FOR FINDING THE MINIMUM FEEDBACK VERTEX SET OF A 3-REGULAR SIMPLE GRAPH

在线阅读下载PDF

导出

摘要 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. 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.

作者李德明刘彦佩

出处《Acta Mathematica Scientia》 SCIE CSCD 1999年第4期375-381,共7页 数学物理学报（B辑英文版）

关键词 maximum genus nonseparating independent number feedback vertex set 3-regular graph adjacency matching maximum genus nonseparating independent number feedback vertex set 3-regular graph adjacency matching

分类号 O241 [理学—计算数学]

引文网络
相关文献

引证文献2

1张少强,王骁力,李国君.A Linear Time Algorithm for Minimum-Weight Feedback Vertex Set Problem in Outerplanar Graphs[J].Journal of Mathematical Research and Exposition,2004,24(4):610-618.
2Shao-qiangZhang,Guo-junLi,Shu-guangLi.A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs[J].Acta Mathematicae Applicatae Sinica,2004,20(4):579-588.

1HUANG Saing(Department of Information and Systems Management,College of Business and Manapement,Hong Kong University of Science and Technology,Clear Water Bag,Kowloon,Hong Kong)Kortanek,K. O.(Department of Management Science,Collage of Business,the Univer.A HYBRID POLYNOMIAL ALGORITHM FOR LINEAR PROGRAMMING[J].Systems Science and Mathematical Sciences,1996,9(1):67-75.
2Junjie YUE,Liping ZHANG,Mei LU.m, argest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths[J].Frontiers of Mathematics in China,2016,11(3):623-645.
3XiaoliWang,ShaoqiangZhang.A Polynomial Algorithm to Find a Packing of Two Graphs[J].Journal of Systems Science and Information,2004,2(1):61-66.
4刘振宏.A NEW SUFFICIENT CONDITION FOR A GRAPH TO BE HAMILTONIAN[J].Chinese Science Bulletin,1987,32(9):639-640.
5张利民.EVERY 4-REGULAR SIMPLE GRAPH CONTAINS A 3-REGULAR SUBGRAPH[J].Chinese Science Bulletin,1986,31(9).
6Zhixiong TAO.On 2-Adjacency Between Links[J].Chinese Annals of Mathematics,Series B,2016,37(5):767-776. 被引量：1
7王世英,殷志祥.Extreme Matroid Graphs[J].Northeastern Mathematical Journal,2003,19(1):19-25.
8黄礼平,万哲先.Geometry of 2×2 hermitian matrices[J].Science China Mathematics,2002,45(8):1025-1037.
9Shao-qiangZhang,Guo-junLi,Shu-guangLi.A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs[J].Acta Mathematicae Applicatae Sinica,2004,20(4):579-588.
10何鋆,陈小青,侯晓远.Effect of traps' adjacency on the electric field dependence of mobility in organic systems[J].Chinese Physics B,2014,23(9):375-379.

Acta Mathematica Scientia

1999年第4期

浏览历史

内容加载中请稍等...

A POLYNOMIAL ALGORITHM FOR FINDING THEMINIMUM FEEDBACK VERTEX SET OF A3-REGULAR SIMPLE GRAPH 被引量：2

引证文献2

相关作者

相关机构

相关主题

浏览历史