The recognizability of sets of graphs is a robust property

Theoretical Computer Science

Volumn 342, Issue 2-3, 2005, Pages 173-228

  Courcelle, Bruno ^a   Weil, Pascal ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b CNRS   (France)

Author keywords

Graph algebra; Hyperedge replacement; Locally finite congruence; Modular decomposition; Quantifier free definable operation; Recognizable set of graphs; Vertex replacement

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; CONTEXT FREE GRAMMARS; INFORMATION TECHNOLOGY; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY;

GRAPH ALGEBRA; HYPEREDGE REPLACEMENT; LOCALLY FINITE CONGRUENCE; MODULAR DECOMPOSITION; QUANTIFIER-FREE DEFINABLE OPERATION; RECOGNIZABLE SET OF GRAPHS; VERTEX REPLACEMENT;

GRAPH THEORY;

EID: 23944474041     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.018     Document Type: Article

References (47)

1. K. Abrahamson, M. Fellows, Finite automata, bounded tree-width and well-quasiordering, in: N. Robertson, P. Seymour (Eds.), Graph Structure Theory. Contemp. Math. 147 (1993) 539-564.
2. S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese An algebraic theory of graph reduction J. ACM 40 1993 1134 1164
3. A. Blumensath, B. Courcelle, Recognizability and hypergraph operations using local information, 2004, Submitted.
4. H.L. Bodlaender A linear-time algorithm for finding tree-decompositions of small treewidth SIAM J. Comput. 25 1996 1305 1317
5. B. Bollobas Extremal Graph Theory 1978 Academic Press New York
6. E. Börger, E. Grädel, and Yu. Gurevich The Classical Decision Problems 1997 Springer Berlin
7. D.G. Corneil, M. Habib, J.-M. Lanlignel, B. Reed, U. Rotics, Polynomial time recognition of clique-width ≤ 3 graphs, Extended abstract. in: G.H. Gonnet, D. Panario, A. Viola (Eds.), LATIN'2000, Lecture Notes in Computer Science, Vol. 1776, 2000, pp. 126-134.
8. B. Courcelle The monadic second-order logic of graphs I: recognizable sets of finite graphs Inform. Comput. 85 1990 12 75
9. B. Courcelle The monadic second-order logic of graphs VII: graphs as relational structures Theoret. Comput. Sci. 101 1992 3 33
10. B. Courcelle Recognizable sets of graphs: equivalent definitions and closure properties Math. Struct. Comput. Sci. 4 1994 1 32
11. B. Courcelle The monadic second-order logic of graphs VI: on several representations of graphs by relational structures Discrete Appl. Math. 54 1994 117 149 Erratum 63 (1995) 199-200
12. B. Courcelle Structural properties of context-free sets of graphs generated by vertex-replacement Inform. Comput. 116 1995 275 293
13. B. Courcelle Basic notions of universal algebra for language theory and graph grammars Theoret. Comput. Sci. 163 1996 1 54
14. B. Courcelle The monadic second-order logic of graphs X: linear orders Theoret. Comput. Sci. 160 1996 87 143
15. B. Courcelle, The expression of graph properties and graph transformations in monadic second order logic, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 1, World Scientific, Singapore, 1997, pp. 313-400 (Chapter 5).
16. B. Courcelle The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications Theoret. Comput. Sci. 299 2003 1 36
17. B. Courcelle, Recognizability of graphs, hypergraphs and relational structures: a survey, in: DLT 2004, Lecture Notes in Computer Science, Vol. 3340, Springer, Berlin, 2004, pp. 1-11.
18. B. Courcelle, J. Engelfriet, and G. Rozenberg Handle rewriting hypergraph grammars J. Comput. System Sci. 46 1993 218 246
19. B. Courcelle, and S. Olariu Upper bounds to the clique-width of graphs Discrete Appl. Math. 101 2000 77 114
20. B. Courcelle, J.A. Makowsky, and U. Rotics Linear time solvable optimization problems on graphs of bounded clique-width Theory Comput. Systems 33 2000 125 150
21. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, in: S. Tison (Ed.), CAAP 1994. Lecture Notes in Computer Science, Vol. 787, Springer, Berlin, 1994, pp. 68-84.
22. V. Diekert The Book of Traces 1995 World Scientific Singapore
23. R. Downey, and M. Fellows Parametrized Complexity 1997 Springer Berlin
24. Z. Ésik, and Z.L. Németh Higher dimensional automata J. Automata, Languages and Combin. 9 2004 3 29
25. S. Feferman, and R. Vaught The first order properties of products of algebraic systems Fundam. Math. 47 1959 57 103
26. M. Frick, and M. Grohe The complexity of first-order and monadic second-order logic revisited Ann. Pure Appl. Logic 130 2004 3 31
27. R. Graham, B. Rothschild, and J. Spencer Ramsey Theory 1980 Wiley New York
28. H.J. Hoogeboom, and P. ten Pas Monadic second-order definable text languages Theory Comput. Systems 30 1997 335 354
29. D. Kuske Towards a language theory for infinite N -free pomsets Theoret. Comput. Sci. 299 2003 347 386
30. D. Kuske Regular sets of infinite message sequence charts Inform. Comput. 187 2003 90 109
31. D. Lapoire, Recognizability equals Monadic Second-Order definability, for sets of graphs of bounded tree-width, in: STACS 98, Lecture Notes in Computer Science, Vol. 1373, Springer, Berlin, 1998, pp. 618-628.
32. K. Lodaya, and P. Weil Series-parallel languages and the bounded-width property Theoret. Comput. Sci. 237 2000 347 380
33. K. Lodaya, and P. Weil Rationality in algebras with a series operation Inform. Comput. 171 2001 269 293
34. J. Makowsky Algorithmic aspects of the Feferman-Vaught Theorem Ann. Pure Appl. Logic 126 2004 159 213
35. R. McConnell, and J. Spinrad Linear-time modular decomposition and efficient transitive orientation of comparability graphs Fifth Annu. ACM-SIAM Symp. on Discrete Algorithms 1994 ACM 536 545
36. R. McConnell, and J. Spinrad Modular decomposition and transitive orientation Discrete Math. 201 1999 189 241
37. J. Mezei, and J. Wright Algebraic automata and context-free sets Inform. Control 11 1967 3 29
38. R.H. Möhring, and F.J. Radermacher Substitution decomposition for discrete structures and connections with combinatorial optimization Ann. Discrete Math. 19 1984 257 356
39. S. Oum, P. Seymour, Approximating clique-width and branch-width, 2004, Submitted.
40. D. Perrin, J.-E. Pin, Infinite Words, Pure and Applied Mathematics, Vol. 141, Elsevier, Amsterdam, 2004.
41. G. Rozenberg Handbook of Graph Grammars and Computing by Graph Transformations 1997 World Scientific Singapore
42. S. Shelah The monadic theory of order Ann. Math. 102 1975 379 419
43. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, pp. 133-192.
44. E. Wanke k - NLC graphs and polynomial algorithms Discrete Appl. Math. 54 1994 251 266
45. W. Wechler Universal Algebra for Computer Scientists 1992 Springer Berlin
46. P. Weil On the logical definability of certain graph and poset languages J. Automata, Languages Comput. 9 2004 147 165
47. P. Weil, Algebraic recognizability of languages, in: J. Fiala, V. Koubek, J. Kratochvíl (Eds.), MFCS 2004, Lecture Notes in Computer Science, Vol. 3153, Springer, Berlin, 2004, pp. 149-175.