Query efficient implementation of graphs of bounded clique-width

Discrete Applied Mathematics

Volumn 131, Issue 1, 2003, Pages 129-150

  Courcelle, B ^a   Vanicat, R ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPTIMIZATION;

COMPUTATION TIME;

GRAPH THEORY;

EID: 0041861272     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00421-3     Document Type: Conference Paper

References (16)

1. Bodlaender H.L. A partial. k-arboretum of graphs with bounded treewidth Theoret. Comput. Sci. 209:1998;1-45.
2. Chaudhuri S., Zaroliagis C.D. Shortest paths in digraphs of small treewidth, Part II. optimal parallel algorithms Theoret. Comput. Sci. 203:1998;205-223.
3. Chaudhuri S., Zaroliagis C.D. Shortest paths in digraphs of small treewidth, Part I. sequential algorithms Algorithmica. 27:2000;212-226.
4. Courcelle B. Fundamental properties of infinite trees. Theoret. Comput. Sci. 25:1983;95-169.
5. Courcelle B. Monadic-second order graph transductions. a survey Theoret. Comput. Sci. 126:1994;53-75.
6. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation. Foundations. Vol. I: 1997;313-400 World Scientific, Singapore. (Chapter 5).
7. Courcelle B., Makowsky J., Rotics U. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math. 108:2001;23-52.
8. Courcelle B., Mosbah M. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109:1993;49-82.
9. Courcelle B., Olariu S. Upper bounds to the clique-width of graphs. Discrete Appl. Math. 101:2000;77-114.
10. Courcelle B., Walukiewicz I. Monadic second-order logic, graph coverings and unfoldings of transition systems. Ann. Pure Appl. Logic. 92:1998;35-62.
11. Engelfriet J., Rozenberg G. Node replacement graph grammars. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation. Foundations. Vol. I:1997;1-94 World Scientific, Singapore. (Chapter 1).
12. C. Gavoille, Private communication and paper in preparation.
13. C. Gavoille, D. Peleg, S. Pérennes, R. Raz, Distance labeling in graphs, in: Proceedings of the 12th Symposium on Discrete Algorithms (SODA), ACM-SIAM, 2001, pp. 210-213.
14. Hagerup T. Dynamic algorithms for graphs of bounded treewidth. Algorithmica. 27:2000;292-315.
15. J. Spinrad, Implicit graph representation, Book in preparation, http://www.vuse.vanderbilt.edu/̃spin/persinfo.html.
16. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier Science Publishers., Amsterdam, 1990, pp. 133-191 (Chapter 4).