Graph operations characterizing rank-width

Discrete Applied Mathematics

Volumn 157, Issue 4, 2009, Pages 627-640

  Courcelle, Bruno ^a   Kanté, Mamadou Moustapha ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Clique width; Graph operation; Hierarchical decomposition; Rank width

Indexed keywords

DECOMPOSITION; TREES (MATHEMATICS);

BOUNDEDNESS CONDITIONS; CLIQUE-WIDTH; COMPLEXITY MEASURES; GRAPH OPERATION; HIERARCHICAL DECOMPOSITION; MONADIC SECOND-ORDER LOGIC; RANK-WIDTH; TRACTABLE ALGORITHMS; TREE WIDTHS;

GRAPH THEORY;

EID: 59749102166     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.08.026     Document Type: Article

References (31)

1. Blumensath A., and Courcelle B. Recognizability, hypergraph operations and logical types. Information and Computation 204 6 (2006) 853-919
2. Corneil D.G., Habib M., Lanlignel J.M., Reed B., and Rotics U. Polynomial-time recognition of clique-width ≤3 graphs. In: Gonnet G.H., Panario D., and Viola A. (Eds). Latin American Symposium on Theoretical Informatics. LNCS vol. 1776 (2000), Springer 126-134
3. Corneil D.G., and Rotics U. On the relationship between clique-width and tree-width. SIAM Journal on Computing 34 4 (2005) 825-847
4. Courcelle B. The monadic second-order logic of graphs VII: Graphs as relational structures. Theoretical Computer Science 101 1 (1992) 3-33
5. Courcelle B. Graph grammars, monadic second-order logic and the theory of graph minors. In: Robertson N., and Seymour P. (Eds). Graph Structure Theory. Contemporary Mathematics vol. 147 (1993), AMS 565-590
6. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg G. (Ed). Handbook of Graph Grammars and Computing by Graph Transformations (1997), World Scientific 313-400
7. Courcelle B., and Kanté M.M. Graph operations characterizing rank-width and balanced graph expressions. In: Brandstädt A., Kratsch D., and Müller H. (Eds). Graph-Theoretic Concepts in Computer Science. LNCS vol. 4769 (2007), Springer 66-75
8. B. Courcelle, M.M. Kanté, Balanced graph expressions, 2007. Manuscript
9. Courcelle B., Makowsky J.A., and Rotics U. Linear-time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33 2 (2000) 125-150
10. Courcelle B., and Olariu S. Upper bounds to the clique-width of graphs. Discrete Applied Mathematics 101 1-3 (2000) 77-114
11. Courcelle B., and Twigg A. Compact forbidden-set routing. In: Thomas W., and Weil P. (Eds). Symposium on Theoretical Aspects of Computer Science. LNCS vol. 4393 (2007), Springer 37-48
12. Courcelle B., and Vanicat R. Query efficient implementation of graphs of bounded clique-width. Discrete Applied Mathematics 131 1 (2003) 129-150
13. Courcelle B., and Weil P. The recognizability of sets of graphs is a robust property. Theoretical Computer Science 342 2-3 (2005) 173-228
14. Diestel R. Graph Theory. 3rd edition (2005), Springer-Verlag Readable for free on: http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/
15. Downey R., and Fellows M. Parameterized Complexity (1999), Springer-verlag
16. Espelage W., Gurski F., and Wanke E. Deciding clique-width for graphs of bounded tree-width. Journal of Graph Algorithms and Applications 7 2 (2003) 141-180
17. Fellows M., Rosamond F.A., Rotics U., and Szeider S. Clique-width minimization is np-hard. In: Kleinberg J.M. (Ed). Symposium on Theory of Computing (2006), ACM 354-362
18. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer Verlag
19. Henriksen J.G., Jensen J.L., Jørgensen M.E., Klarlund N., Paige R., Rauhe T., and Sandholm A. MONA: Monadic second-order logic in practice. In: Brinksma E., Cleaveland R., Larsen K.G., Margaria T., and Steffen B. (Eds). Tools and Algorithms for Construction and Analysis of Systems. LNCS vol. 1019 (1995), Springer 89-110
20. Hliněný P., and Oum S. Finding branch-decompositions and rank-decompositions. In: Arge L., Hoffmann M., and Welzl E. (Eds). European Symposium on Algorithms. LNCS vol. 4698 (2007), Springer 163-174
21. Johansson Ö. Clique-decomposition, NLC-decomposition and modular decomposition - Relationships and results for random graphs. Congressus Numerantium 132 (1998) 39-60
22. Kanté M.M. Vertex-minor reductions can simulate edge contractions. Discrete Applied Mathematics 155 17 (2007) 2328-2340
23. M.M. Kanté, The rank-width of directed graphs (2008) (submitted for publication). ArXiv: http://arxiv.org/abs/0709.1433
24. Lozin V., and Rautenbach D. The relative clique-width of graphs. Journal of Combinatorial Theory, Series B 97 5 (2007) 846-858
25. Makowsky J.A. Algorithmic uses of the Feferman-Vaught Theorem. Annals of Pure and Applied Logic 126 1-3 (2004) 159-213
26. Oum S. Rank-width is less than or equal to branch-width. Journal of Graph Theory 57 3 (2007) 239-244
27. Oum S. Rank-width and vertex-minors. Journal of Combinatorial Theory, Series B 95 1 (2005) 79-100
28. Oum S., and Seymour P. Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B 96 4 (2006) 514-528
29. Robertson N., and Seymour P. Graph minors V: Excluding a planar graph. Journal of Combinatorial Theory, Series B 41 1 (1986) 92-114
30. Robertson N., and Seymour P. Graphs minors X: Obstructions to tree-decompositions. Journal of Combinatorial Theory, Series B 52 2 (1991) 153-190
31. Wanke E. k-NLC graphs and polynomial algorithms. Discrete Applied Mathematics 54 2-3 (1994) 251-266