Well-quasi-orders in subclasses of bounded treewidth graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5917 LNCS, Issue , 2009, Pages 149-160

  Fellows, Michael R ^a   Hermelin, Danny ^b   Rosamond, Frances A ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED FEEDBACK; BOUNDED TREEWIDTH; SUBGRAPHS; TOPOLOGICAL-MINOR;

GRAPH THEORY;

EID: 72249083801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11269-0_12     Document Type: Conference Paper

References (15)

1. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability. A survey. BIT Numerical Mathematics 25(1), 2-23 (1985)
2. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics 23, 11-24 (1989)
3. Bodlaender, H.L., Fellows, M.R., Hallett, M.T.: Beyond NP-completeness for problems of bounded width: Hardness for the W-hierarchy. In: Proceedings of the 26th annual ACM Symposium on Theory of Computing (STOC), pp. 449-458 (1994)
4. Corneil, D.G., Keil, J.M.: A dynamic programming approach to the dominating set problem on k-trees. SIAM Journal on Algebraic and Discrete Methods 8(4), 535-543 (1987)
5. Courcelle, B.: The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Information and Computation 85(1), 12-75 (1990)
6. Ding, G.: Subgraphs and well-quasi-ordering. Journal of Graph Theory 16(5), 489-502 (1992)
7. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
8. Fellows, M.R., Langston, M.A.: Fast self-reduction algorithms for combinatorial problems of VLSI design. In: Proc. of the 3rd Aegean Workshop On Computing (AWOC), pp. 278-287 (1988)
9. Fellows, M.R., Langston, M.A.: On well-paritial-order theory and its application to combinatorial problems of VLSI design. SIAM Journal on Discrete Mathematics 5 (1992)
10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
11. Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture. Transactions of the American Mathematical Society 95, 210-225 (1960)
12. Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae 10, 96-115 (1927)
13. Nash-Williams, C.S.J.A.: On well-quasi-ordering finite trees. Mathematical Proceedings of the Cambridge Philosophical Society 59(4), 833-835 (1963)
14. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
15. Thomas, R.: Well-quasi-ordering infinite graphs with forbidden finite planar minor. Transactions of the American Mathematical Society 312(1), 67-76 (1990)