首页> 外文OA文献 >Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs and their Algorithmic Applications

【2h】

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs and their Algorithmic Applications

机译：有界树宽图的子类中的拟准顺序及其算法应用

页面导航

著录项
相似文献
相关主题

著录项

作者
Michael R. Fellows; Danny Hermelin; Frances A. Rosamond;
展开▼
作者单位

展开▼
年度 2012
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications [J] . Michael R. Fellows, Danny Hermelin, Frances A. Rosamond Algorithmica . 2012,第1期

机译：有界树宽图的子类中的良好拟序及其算法应用
2. Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms [J] . Baste Julien, Sau Ignasi, Thilikos Dimitrios M. Theoretical computer science . 2020,第期

机译：击中有界树木宽度图的未成年人。 II。单指数算法
3. Generalized Feedback Vertex Set Problems　on Bounded-Treewidth Graphs: Chordality is the Key　to Single-Exponential Parameterized Algorithms [J] . Bonnet Edouard, Brettell Nick, Kwon O-joung, Algorithmica . 2019,第10期

机译：有界树图上的广义反馈顶点集问题：和弦性是单指数参数化算法的关键
4. Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs [C] . Michael R. Fellows, Danny Hermelin, Frances A. Rosamond Parameterized and exact computation . 2009

机译：有界树宽图的子类中的良好拟序
5. Linear-time algorithms for graphs with bounded branchwidth. [D] . Christian, William Anderson, Jr. 2003

机译：具有有限分支宽度的图的线性时间算法。
6. On the Treewidths of Graphs of Bounded Degree [O] . Yinglei Song, Menghong Yu -1

机译：有界度图的树宽
7. Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications [O] . Fellows M., Hermelin D., Rosamond F. 2012

机译：有界树宽图子类及其算法应用中的准拟序
8. Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs [R] . Broersma, H. J., Dahlhaus, E., Kloks, T. 1996

机译：无HHD图的树宽和最小填充算法

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs and their Algorithmic Applications

著录项

相似文献

相关主题

期刊订阅