首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A POLYNOMIAL ALGORITHM FOR FINDING THE MINIMUM FEEDBACK VERTEX SET OF A 3-REGULAR SIMPLE GRAPH
Authors:Li Dcming
Abstract:A subset of the vertex set of a graph is a feedback vcrtex set of the graph if theresulting graph is a forest after removed the vertex subset from the graph. A polynomialalgorithm for finding a minimum feedback vertex set of a 3-regular simple graph is provided.
Keywords:maximum genus  nonseparating independent number  feedback vertex set  3-regular graph  adjacency matching
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号