On computing graph minor obstruction sets

Theoretical Computer Science

Volumn 233, Issue 1-2, 2000, Pages 107-127

  Cattell, Kevin ^a   Dinneen, Michael J ^b   Downey, Rodney G ^c   Fellows, Michael R ^a   Langston, Michael A ^d  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

^c VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^d University of Tennessee   (United States)

Author keywords

Automatic theorem proving; Finite automata; Graph minors; Intertwines; Obstruction set computation; Well quasi ordering

Indexed keywords

EID: 0042864339     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00300-9     Document Type: Article

References (26)

1. K.R. Abrahamson, M.R. Fellows, Finite automata, bounded treewidth and well-quasiordering, in: Graph Structure Theory, Contemporary Mathematics, vol. 147, American Mathematical Society, Providence, RI, 1993, pp. 539-564.
2. S. Arnborg, A. Proskurowski, D. Seese, Monadic second-order logic: tree automata and forbidden minors, Technical Report, University of Oregon, Dept. of Computer and Information Sciences UOCIS-TR-90/23, 1990.
3. D. Bienstock, N. Robertson, P.D. Seymour, R. Thomas, Quickly excluding a forest, J. Combin. Theory Ser. B 52 (1991) 274-283.
4. H.P. Bodlaender, M.R. Fellows, T.J. Warnow, Two strikes against perfect phylogeny, Proc. 19th Internat. Colloq. on Automata, Languages and Programming (ICALP '92), Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 273-283.
5. K. Cattell, M.J. Dinneen, A characterization of graphs with vertex cover up to five, Proc. ORDAL'94, Lecture Notes in Computer Science, vol. 831, Springer, Berlin, 1994, pp. 86-99.
6. K. Cattell, M.J. Dinneen, M.R. Fellows, Obstructions to within a few vertices or edges of acyclic, Proceedings WADS'95, Lecture Notes in Computer Science, vol. 955, Springer, Berlin, 1995, pp. 415-427.
7. K. Cattell, M.J. Dinneen, M.R. Fellows, A simple linear time algorithm for finding path decompositions of small width, Inform. Process. Lett. 57 (1996) 197-203.
8. B. Courcelle, The monadic second order logic of graphs I: recognizable sets of finite graphs, Inform. and Comput. 85 (1990) 12-75.
9. B. Courcelle, J. Lagergren, Equivalent definitions of recognizability for graphs of bounded tree-width, Math. Struct. Comput. Sci. 6 (1996) 141-165.
10. R. Downey, M. Fellows, Parameterized computational feasibility, in: P. Clote, J. Remmel (Eds.), Proc. 2nd Cornell Workshop on Feasible Mathematics, Birkhauser, Basel, 1985, pp. 219-244.
11. M.R. Fellows, M.T. Hallett, T. Wareham, DNA physical mapping: three ways difficult, Proc. 1st Eur. Symp. on Algorithms (ESA '93), Lecture Notes in Computer Science, vol. 726, Springer, Berlin, 1993, pp. 157-168.
12. M.R. Fellows, M.A. Langston, Nonconstructive tools for proving polynomial-time decidability, J. ACM 35 (1988) 727-739.
13. M.R. Fellows, M.A. Langston, On search, decision and the efficiency of polynomial-time algorithms, Proc. Symp. on the Theory of Computing (STOC), ACM, New York, 1989, pp. 501-512.
14. M.R. Fellows, M.A. Langston, An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations, Proc. Symp. on the Foundations of Computer Science (FOCS), IEEE Press, New York, 1989, pp. 520-525.
15. A. Gupta, R. Impagliazzo, Computing planar intertwines, Proc. 1991 Symp. on the Foundations of Computer Science (FOCS '91), IEEE Press, New York, 1991.
16. N.G. Kinnersley, Constructive obstruction set isolation for min cut linear arrangement, Technical Report, 1994, Computer Science Department, Univ. of Iowa, Ames, Iowa.
17. N.G. Kinnersley, M.A. Langston, Obstruction set isolation for the gate matrix layout problem, Discrete Appl. Math. 54 (1994) 169-213.
18. J. Lagergren, An upper bound on the size of an obstruction, in: Graph Structure Theory, Contemporary Mathematics, vol. 147, American Mathematical Society, Providence, RI, 1993, pp. 601-622.
19. J. Lagergren, S. Amborg, Finding minimal forbidden minors using a finite congruence, Proc. 18th Internat. Colloq. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 510, Springer, Berlin, 1991, pp. 533-543.
20. W. Mader, Hinreichende dedingungen fur die existenz von teilgraphen, die zu einem vollstandigen graphen homomorph sind, Abh. Math, Sem. Hamburg Univ. 37 (1972) 86-97.
21. C.St.J.A. Nash-Williams, On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59 (1963) 833-835.
22. A. Proskurowski, Graph reductions, and techniques for finding minimal forbidden minors, in: Graph Structure Theory, Contemporary Mathematics, vol. 147, American Mathematical Society, Providence, RI, 1993, pp. 591-600.
23. N. Robertson, P.D. Seymour, Graph minors I: Excluding a forest, J. Combin. Theory Ser. B 35 (1983) 39-61.
24. N. Robertson, P.D. Seymour, Graphs minors - a survey, in: I. Anderson (Ed.), Surveys in Combinatorics, Cambridge University Press, 1985, Cambridge, pp. 153-171.
25. N. Robertson, P.D. Seymour, Graph minors XVI: Wagner's conjecture, J. Combin. Theory Ser. B, to appear.
26. N. Robertson, P.D. Seymour, R. Thomas, Quickly excluding a planar graph, J. Combin. Theory Ser. B 62 (1994) 323-348.