Graph operations characterizing rank-width and balanced graph expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4769 LNCS, Issue , 2007, Pages 66-75

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

^a UNIVERSITÉ BORDEAUX 1   (France)

^b INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PARAMETER ESTIMATION; THEOREM PROVING;

BALANCING THEOREMS; FIXED PARAMETER TRACTABLE ALGORITHMS; RANK-WIDTH;

TREES (MATHEMATICS);

EID: 38549177883     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74839-7_7     Document Type: Conference Paper

References (18)

1. Bodlaender, H.L.: NC-algorithms for graphs with small tree-width. In: van Leeuwen, J. (ed.) Graph-Theoretic Concepts in Computer Science. LNCS, vol. 344, pp. 1-10. Springer, Heidelberg (1989)
2. Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded tree-width. SIAM J. Comput. 27, 1725-1746 (1998)
3. Blumensath, A., Courcelle, B.: Recognizability, hypergraph operations and logical types. Information and Computation 204, 853-919 (2006)
4. Courcelle, B., Kanté, M.M.: Multiple Colorings : graph operations characterizing rank-width and balanced graph expressions. Available on http://www.labri.fr/perso/courcell/courcelle_kante07.pdf
5. Courcelle, B., Kanté, M.M.: Balanced Graph Expressions, manuscript (2007)
6. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33, 125-150 (2000)
7. Courcelle, B., Olariu, S.: Upper bounds to the clique-width of graphs. Discrete Applied Mathematics 101, 77-114 (2000)
8. Courcelle, B., Twigg, A.: Compact Forbidden-set Routing. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 37-48. Springer, Heidelberg (2007)
9. Courcelle, B., Vanicat, R.: Query efficient implementation of graphs of bounded clique-width. Discrete Applied Mathematics 131, 129-150 (2003)
10. Courcelle, B., Weil, P.: The recognizability of sets of graphs is a robust property. Theor. Comput. Sci. 342, 173-228 (2005)
11. Downey, R., Fellows, M.: Parameterized complexity. Springer, Heidelberg (1999)
12. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
13. Hliněný, P., Oum, S.: Finding Branch-decompositions and Rank-decompositions. In: Algorithms-ESA 2007. LNCS, vol. 4698, pp. 163-174. Springer, Heidelberg (October 2007)
14. Kanté, M.M.: Vertex-minor reductions can simulate edge contractions. Discrete Applied Mathematics 155(17), 2328-2340 (2007)
15. Oum, S.: Approximating rank-width and Clique-width Quickly. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 49-58. Springer, Heidelberg (2005)
16. Oum, S., Seymour, P.: Approximating clique-width and branch-width. J. Combin Theory, Ser B 96, 514-528 (2006)
17. Robertson, N., Seymour, P.: Graph minors V: excluding a planar graph. J. Combin. Theory (B) 41, 92-114 (1986)
18. Wanke, E.: k-NLC graphs and Polynomial algorithms. Discrete Applied Mathematics 54, 251-266 (1994)