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


Feedback vertex set on AT-free graphs
Authors:Dieter Kratsch
Affiliation:a Laboratoire d’Informatique Théorique et Appliquée, Université de Metz, 57045 Metz Cedex 01, France
b School of Computing, University of Leeds, Leeds LS2 9JT, UK
c Laboratoire d’Informatique Fondamentale d’Orléans (LIFO), Université d’Orléans, BP 6759, 45067 Orléans Cedex 2, France
Abstract:We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for graphs of bounded asteroidal number.
Keywords:Feedback vertex set   Asteroidal triple-free graph
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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