Upper bounds to the clique width of graphs

Discrete Applied Mathematics

Volumn 101, Issue 1-3, 2000, Pages 77-114

  Courcelle, Bruno ^a   Olariu, Stephan ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b Old Dominion University   (United States)

Author keywords

Algorithms; Hierarchical graph decompositions; Modular decomposition; Monadic second order logic; Tree decompositions

Indexed keywords

EID: 0002015577     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00184-5     Document Type: Article

References (26)

1. Arnborg S., Lagergren J., Seese D. Easy problems for tree-decomposable graphs. J. Algorithms. 12:1991;308-340.
2. Arnborg S., Courcelle B., Proskurowski A., Seese D. An algebraic theory of graph reductions. J. ACM. 40:1993;1134-1164.
3. Corneil D.G., Perl Y., Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14:1985;926-934.
4. 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, World Scientific, New Jersey, 1997, pp. 313-400.
5. Courcelle B. An axiomatic definition of context-free rewriting and its application to NLC graph grammars. Theoret. Comput. Sci. 55:1987;141-181.
6. Courcelle B. The monadic second-order logic of graphs I, Recognizable sets of finite graphs. Inform. and Comput. 85:1990;12-75.
7. Courcelle B. he monadic second-order logic of graphs III, Tree-decompositions, minors and complexity issues. Inform. Théorique Appl. 26:1992;257-286.
8. Courcelle B. The monadic second order logic of graphs VII. Graphs as relational structures Theoret. Comput. Sci. 101:1992;3-33.
9. Courcelle B. The monadic second order logic of graphs VIII. Orientations Ann. Pure Appl. Logic. 72:1995;103-143.
10. Courcelle B. Structural properties of context-free sets of graphs generated by vertex-replacement. Inform. and Comput. 116:1995;275-293.
11. Courcelle B. The monadic second-order logic of graphs X. linear orderings Theoret. Comput. Sci. 160:1996;87-143.
12. Courcelle B., Engelfriet J. A logical characterization of hypergraph languages generated by hyperedge replacement grammars. Math. System Theory. 28:1995;515-552.
13. Courcelle B., Engelfriet J., Rozenberg G. Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46:1993;218-270.
14. B. Courcelle, J. Makowsky, U. Rotics, Linear-time solvable optimization problems on certain structured graphs, Proceedings of WG'98, to appear.
15. Courcelle B., Mosbah M. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109:1993;49-82.
16. B. Courcelle, S. Olariu, Some graph transformations that preserve clique width (an appendix to "Upper Bounds to the Clique-Width of Graphs"), http: // dept-info.labri.u-bordeaux.fr /~ courcell / ActSci.ht ml or // http: // www.cs.odu.edu /~ olariu / cwd.html.
17. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, preprint 1995; preliminary version in Proceedings of CAAP'94, Lecture Notes in Computer Science, Vol. 787, 1994, pp. 68-84.
18. A. Ehrenfeucht, T. Harju, G. Rozenberg, 2-structures, a framework for decomposition and transformation of graphs, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, World Scientific, New Jersey, 1997, pp. 401-478.
19. J. Engelfriet, A characterization of context-free NCE graph languages by monadic second-order logic on trees, in Fourth International Workshop on Graph Grammars and their Applications to Computer Science, Lecture Notes in Computer Science, Vol. 532, 1991, pp. 311-327.
20. J. Engelfriet, G. Rozenberg, Node replacement graph grammars, in: G. Rozenberg (Ed.), Handbook of Graph Grammars and Computing by Graph Transformations, World Scientific, New Jersey, 1997, pp. 1-94.
21. Hedetniemi S. Efficient algorithms and partial. k -trees Discrete Appl. Math. 54:1994;281-290.
22. Muller J., Spinrad J. Incremental modular decomposition. J. ACM. 36:1989;1-19.
23. Robertson N., Seymour P. Graph minors V, Excluding a planar graph. J. Combin. Theory (B). 41:1986;92-114.
24. Seese D. The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Logic. 53:1991;169-195.
25. J. Van Leeuwen, Graph algorithms, Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 525-631 (Chapter 10).
26. Wanke E. k-NLC graphs and polynomial algorithms. Discrete Appl. Math. 54:1994;251-266.