Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs

DOI10.1007/978-3-642-11269-0_12zbMath1264.68120WikidataQ57359842 ScholiaQ57359842MaRDI QIDQ3656858

Frances A. Rosamond, Michael R. Fellows, Danny Hermelin

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_12

zbMATH Keywords

refinements; bounded treewidth graphs; well-quasi-ordered

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

06A99: Ordered sets

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Induced minors and well-quasi-ordering, Well-structured graph transformation systems, Sublinear approximation algorithms for boxicity and related problems, Hypertree-depth and minors in hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Parametrized complexity theory.
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Beyond NP-completeness for problems of bounded width (extended abstract)
• A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
• On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
• Subgraphs and well‐quasi‐ordering
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture