A note on the computability of graph minor obstruction sets for monadic second order ideals 1

Journal of Universal Computer Science

Volumn 3, Issue 11, 1997, Pages 1194-1198

  Courcelle, Bruno ^a   Downey, Rodney G ^b   Fellows, Michael R ^c  

^a UNIVERSITÉ DE BORDEAUX   (France)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^c UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Decidability; Monadic second order logic; Well quasi ordering

Indexed keywords

EID: 0042374663     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. [APS90] S. Arnborg, A. Proskurowski and D. Seese. Monadic second-order logic: tree automata and forbidden minors. Technical Report, University of Oregon, Dept. of Computer and Information Sciences UO-CIS-TR-90/23, 1990.
2. [CDDFL97] K. Cattell, M. J. Dinneen, R. G. Downey, M. R. Fellows and M. A. Langston. On computing graph minor obstruction sets. Manuscript available from mfellows@csr.uvic.ca, 1997.
3. [CD94] K. Cattell and M. J. Dinneen. A characterization of graphs with vertex cover up to five. Proceedings ORDAL'94, Springer Verlag, Lecture Notes in Computer Science vol. 831 (1994), 86-99.
4. [CDF95] K. Cattell, M. J. Dinneen and M. R. Fellows. Obstructions to within a few vertices or edges of acyclic. Proc. Workshop on Algorithms and Data Structures, Springer-Verlag, Lecture Notes in Computer Science vol. 955 (1995), 415-427.
5. [Co90a] B. Courcelle. The monadic second order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 (1990), 12-75.
6. [Co90b] B. Courcelle. Graph rewriting: an algebraic and logical approach. In: The Handbook of Theoretical Computer Science, Chapter 5, Elsevier, 1990.
7. [Co92] B. Courcelle. The monadic second order logic of graphs III: Treedecompositions, minors and complexity issues. Theoretical Informatics and Applications 26 (1992), 257-286.
8. [FL89a] M. R. Fellows and M. A. Langston. On search, decision and the efficiency of polynomial-time algorithms. Proc. Symposium on the Theory of Computing (STOC), ACM Press (1989), 501-512.
9. [FL89b] M. R. Fellows and M. A. Langston. An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations. Proc. Symposium on the Foundations of Computer Science, IEEE Press (1989), 520-525.
10. [GI91] A. Gupta and R. Impagliazzo. Computing planar intertwines. Proc. 1991 Symposium on the Foundations of Computer Science, IEEE Press (1991).
11. [Kin94] N. G. Kinnersley. Constructive obstruction set isolation for min cut linear arrangement. Technical Report, 1994, Computer Science Department, Univ. of Iowa, Ames, Iowa.
12. [KL91] N. G. Kinnersley and M. A. Langston. Obstruction set isolation for the gate matrix layout problem. Discrete Appl. Math. 54 (1994), 169-213.
13. [LA91] J. Lagergren and S. Arnborg. Finding minimal forbidden minors using a finite congruence. Proc. 18th International Colloquium on Automata, Languages and Programming, Springer-Verlag, Lecture Notes in Computer Science vol. 510 (1991), 533-543.
14. [Lag93] J. Lagergren. An upper bound on the size of an obstruction. In Graph Structure Theory, Contemporary Mathematics vol. 147, pp. 601-622. American Mathematical Society, 1993.
15. [Pr93] A. Proskurowski. Graph reductions, and techniques for finding minimal forbidden minors. In Graph Structure Theory, Contemporary Mathematics vol. 147, pp. 591-600. American Mathematical Society, 1993.
16. [RS83] N. Robertson and P. D. Seymour. Graph minors I: Excluding a forest. J. Comb. Theory Series B 35 (1983), 39-61.
17. [RS85] N. Robertson and P. D. Seymour. Graphs minors - a survey. In Surveys in Combinatorics, I. Anderson, Ed. Cambridge University Press, 1985, pp. 153-171.
18. [RS94] N. Robertson and P. D. Seymour. Graph minors XVI: Wagner's conjecture. J. Comb. Th. Ser. B, to appear.
19. [Se75] D. Seese. Ein Unentscheidbarkeitskreiterium. Wiss. Z. der Humbold Univ. Zu Berlin Math. Natur. Wiss. R24 (1975), 772-780.
20. [Se91] D. Seese. The structure of the models of decidable monadic theories of graphs. Annals of Pure and Applied Logic 53 (1991), 169-195.
21. [Tr50] B. Trakhtenbrot. Impossibility of an algorithm for the decision problem on finite classes. Dokl. Akad. Nauk SSSR 70 (1950), 569-572.