MSOL partitioning problems on graphs of bounded treewidth and clique-width

Theoretical Computer Science

Volumn 377, Issue 1-3, 2007, Pages 260-267

  Rao, Michaël ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

Clique width; Graph algorithms; Monadic second order logic; Treewidth; Vertex partitioning

Indexed keywords

ALGORITHMS; EDGE DETECTION; FORMAL LOGIC; POLYNOMIALS; PROBLEM SOLVING;

CLIQUE WIDTH; DOMATIC NUMBER; H-FREE COLORING; MONADIC SECOND ORDER LOGIC (MSOL); VERTEX PARTITIONING;

TREES (MATHEMATICS);

EID: 34247647398     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.03.043     Document Type: Article

References (25)

1. Arnborg S., Lagergren J., and Seese D. Easy problems for tree-decomposable graphs. Journal of Algorithms 12 (1991) 308-340
2. Bodlaender H.L. Achromatic number is NP-complete for cographs and interval graphs. Information Processing Letters 31 (1989) 135-138
3. Bodlaender H.L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms 11 (1990) 631-643
4. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernetica 11 (1993) 1-23
5. Bodlaender H.L. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25 (1996) 1305-1317
6. Chudnovsky M., Robertson N., Seymour P., and Thomas R. The strong perfect graph theorem. Annals of Mathematics 164 (2006) 51-229
7. Corneil D.G., and Rotics U. On the relationship between clique-width and treewidth. SIAM Journal on Computing 34 (2005) 825-847
8. Courcelle B. The monadic second-order logic of graphs III: Tree-decompositions, minor and complexity issues. Informatique Théorique et Applications 26 (1992) 257-286
9. Courcelle B. The monadic second-order logic of graphs VI: On several representations of graphs by relational structures. Discrete Applied Mathematics 54 (1994) 117-149
10. Courcelle B., Engelfriet J., and Rozenberg G. Handle-rewriting hypergraph languages. Journal of Computer and System Sciences 46 (1993) 218-270
11. Courcelle B., Makowsky J.A., and Rotics U. Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems 33 (2000) 125-150
12. Courcelle B., and Oum S. Vertex-minors, monadic second-order logic, and a conjecture by seese. Journal of Combinatorial Theory Series B 97 (2007) 91-126
13. Ebbinghaus H.-D., and Flum J. Finite Model Theory (1995), Springer-Verlag, Berlin
14. Espelage W., Gurski F., and Wanke E. How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. Proceedings of WG 2001. LNCS vol. 2204 (2001) 117-128
15. Espelage W., Gurski F., and Wanke E. Deciding clique-width for graphs of bounded tree-width. Journal of Graph Algorithms and Applications 7 (2003) 141-180
16. Feferman S., and Vaught R. The first order properties of algebraic systems. Fundamenta Mathematicae 47 (1959) 57-103
17. Gerber M.U., and Kobler D. Algorithms for vertex-partitioning problems on graphs with fixed clique-width. Theoretical Computer Science 299 (2003) 719-734
18. Läuchli H. A decision procedure for the weak second order theory of linear order. Logic Colloquium '66 (1968), North Holland, Amsterdam 189-197
19. Lautemann C. Logical definability of NP-optimization problems with monadic auxiliary predicates. LNCS vol. 702 (1993) 327-339
20. Lozin V.V., and Rautenbach D. The tree- and clique-width of bipartite graphs in special classes. Australasian Journal of Combinatorics 34 (2006) 57-68
21. Makowsky J. Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic 126 (2004) 159-213
22. Oum S. Approximating rank-width and clique-width quickly. Proceedings of WG 2005. LNCS vol. 3787 (2005) 49-58
23. Oum S., and Seymour P. Approximating clique-width and branch-width. Journal of Combinatorial Theory Series B 96 (2006) 514-528
24. Shelah S. The monadic theory of order. Annals of Mathematics 102 (1975) 379-419
25. Telle J.A., and Proskurowski A. Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics 10 (1997) 529-550