On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

Discrete Applied Mathematics

Volumn 158, Issue 7, 2010, Pages 851-867

  Ganian, Robert ^a   Hliněný, Petr ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Graph colouring; Myhill Nerode theorem; Parameterized algorithm; Rank width

Indexed keywords

ALGEBRAIC EXPRESSION; CLIQUE-WIDTH; DYNAMIC ALGORITHM; GRAPH COLOURING; GRAPH PRODUCT; MATHEMATICAL FRAMEWORKS; MYHILL-NERODE THEOREM; NEW APPROACHES; PARAMETERIZED ALGORITHM; PARSE TREES; RANK-WIDTH; RUNTIMES; STRUCTURAL GRAPH;

GENE EXPRESSION;

GRAPH THEORY;

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

References (25)

1. Abrahamson K.A., and Fellows M.R. Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory, Contemporary Mathematics 147 (1993), American Mathematical Society 539-564
2. Arnborg S., Lagergren J., and Seese D. Problems easy for tree-decomposible graphs. Proc. 15th Colloq. Automata, Languages and Programming. Lecture Notes in Comput. Sci. vol. 317 (1988), Springer, Berlin 38-51
3. Bandelt H.-J., and Mulder H.M. Distance-hereditary graphs. J. Combin. Theory Ser. B 41 2 (1986) 182-208
4. Bui-Xuan B.-M., Telle J.A., and Vatshelle M. H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Appl. Math. 158 7 (2010) 809-819
5. Corneil D.G., and Rotics U. On the relationship between cliquewidth and treewidth. SIAM J. Comput. 34 4 (2005) 825-847
6. Courcelle B. The monadic second-order logic of graphs I. Recognizable sets of Finite Graphs. Inform. Comput. 85 (1990) 12-75
7. Courcelle B., and Kanté M.M. Graph operations characterizing rank-width and balanced graph expressions. Graph-theoretic Concepts in Computer Science. Lecture Notes in Comput. Sci. vol. 4769 (2007), Springer, Berlin 66-75
8. Courcelle B., and Kanté M.M. Graph operations characterizing rank-width. Discrete Appl. Math. 157 4 (2009) 627-640
9. Courcelle B., Makowsky J.A., and Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33 2 (2000) 125-150
10. Courcelle B., and Olariu S. Upper bounds to the clique width of graphs. Discrete Appl. Math. 101 1-3 (2000) 77-114
11. Downey R.G., and Fellows M.R. Parameterized Complexity. Monographs in Computer Science (1999), Springer-Verlag, New York
12. Espelage W., Gurski F., and Wanke E. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. Graph-theoretic Concepts in Computer Science. Lecture Notes in Comput. Sci. vol. 2204 (2001), Springer, Berlin 117-128
13. Frick M., and Grohe M. The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130 (2004) 3-31
14. R. Ganian, Automata formalization for graphs of bounded rank-width. Master thesis. Faculty of Informatics of the Masaryk University, Brno, Czech republic, 2008
15. R. Ganian, P. Hliněný, Automata approach to graphs of bounded rank-width, in: IWOCA 2008, proceedings, 2008, pp. 4-15
16. R. Ganian, P. Hliněný, Better polynomial algorithms on graphs of bounded rank-width, in: IWOCA 2009, in: Lecture Notes in Comput. Sci. (in press)
17. Gerber M.U., and Kobler D. Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoret. Comput. Sci. 299 1-3 (2003) 719-734
18. Goldman J., and Rota G.-C. The number of subspaces of a vector space. In: Tutte. W.T. (Ed). Recent Progress in Combinatorics (1969), Academic Press 75-83
19. Hliněný P. Branch-width, parse trees, and monadic second-order logic for matroids. J. Combin. Theory Ser. B 96 3 (2006) 325-351
20. Hliněný P., and Oum S. Finding branch-decomposition and rank-decomposition. SIAM J. Comput. 38 (2008) 1012-1032
21. Kobler D., and Rotics U. Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126 2-3 (2003) 197-221
22. Oum S. Rank-width and vertex-minors. J. Combin. Theory Ser. B 95 1 (2005) 79-100
23. Oum S., and Seymour P. Approximating clique-width and branch-width. J. Combin. Theory Ser. B 96 4 (2006) 514-528
24. Rao M. MSOL partitioning problems on graphs of bounded treewidth and clique-width. Theoret. Comput. Sci. 377 (2007) 260-267
25. Robertson N., and Seymour P. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 2 (1991) 153-190