Equivalent definitions of recognizability for sets of graphs of bounded tree-width

Mathematical Structures in Computer Science

Volumn 6, Issue 2, 1996, Pages 141-165

  Courcelle, Bruno ^a   Lagergren, Jens ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORESTRY; GRAPHIC METHODS;

FINITE GRAPHS; NUMBER OF SOURCES; TREE-WIDTH;

TREES (MATHEMATICS);

PROBLEM SOLVING; TREES;

EID: 0346520754     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096012950000092X     Document Type: Article

References (12)

1. Abrahamson, K. and Fellows, M. (1993) Finite automata, bounded tree-width and wellquasiordering. Robertson, N. and Seymour, P. (eds. Graph Structure Theory Contemporary Mathematics 147 539-564
2. Arnborg, S., Courcelle, B., Proskurowski, A. and Seese, D. (1993) An algebraic theory of graph reduction. Journal of ACM 40 (5) 1134-1164.
3. Arnborg, S., Lagergren, J. and Seese, D. (1991) Problems easy for tree-decomposable graphs. Journal of Algorithms 12 308-340.
4. Courcelle, B. (1990) The monadic second order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 12-75.
5. Courcelle, B. (1992) The monadic second-order logic of graphs III: Tree-decompositions, minors and complexity issues. Informatique Theorique et Applications 26 257-286.
6. Courcelle, B. (1994) Recognizable sets of graphs: equivalent definitions and closure properties. Mathematical Structures in Computer Science 4 1-32.
7. Courcelle, B. and Lagergren, J. (1994) Recognizable sets of graphs of bounded tree-width. In: Proceedings of a Dagsthul Seminar on Graph grammars held in 1993. Springer-Verlag Lecture Notes in Computer Science 776 138-152.
8. Engelfriet, J. (1994) Tree transductions and graph grammars. In: Proceedings CAAP 94. Springer- Verlag Lecture Notes in Computer Science 787 15-36.
9. Habel, A. (1992) Hyperedge replacement: grammars and languages. Springer-Verlag Lecture Notes in Computer Science 643.
10. Habel, A., Kreowski, H. J. and Lautemann, C. (1991) A comparison of compatible, finite, and inductive graph properties. Theoretical Computer Science 89 33-62.
11. Lagergren, J. and Arnborg, S. (1991) Finding minimal forbidden minors using a finite congruence. In: Proceedings 18th ICALP. Springer-Verlag Lecture Notes in Computer Science 510 532-543.
12. Mezei, J. and Wright, J. (1967) Algebraic automata and context-free sets. Information and Control 11 3-29.