On the relationship between clique-width and treewidth

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

Volumn 2204, Issue , 2001, Pages 78-90

  Corneil, Derek G ^a   Rotics, Udi ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b NETANYA ACADEMIC COLLEGE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH ALGORITHMS; POLYNOMIAL APPROXIMATION;

BOUNDED TREEWIDTH; CLIQUE-WIDTH; GRAPH G; GRAPH PROBLEMS; LOWER BOUNDS; MONADIC SECOND-ORDER LOGIC; POLYNOMIAL-TIME ALGORITHMS; TREE-WIDTH;

GRAPH THEORY;

EID: 23044531745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45477-2_9     Document Type: Conference Paper

References (15)

1. S. Arnborg, D. G. Corneil and A. Proskurowski, "Complexity of finding embeddings in a k-tree" SIAM J. Alg. Discrete Methods 8 (1987) 277-284.
2. H. L. Bodlaender, "A linear time algorithm for finding tree-decompositions of small treewidth" SIAM J. Comput. 25 (1996) 1305-1317.
3. A. Brandstädt and V.V. Lozin, "On the linear structure and clique-width of bipartite permutation graphs" Rutcor Research Report 29-2001 (2001).
4. D. G. Corneil, M. Habib, J. M. Lanlignel, B. Reed and U. Rotics, "Polynomial time recognition of clique-width ≤ 3 graphs (Extended Abstract)" accepted to Latin American Theoretical INformatic, LATIN’2000.
5. D. G. Corneil, Y. Perl and L. Stewart, "A linear recognition algorithm for cographs" SIAM J. Comput. 14 (1985) 926-934.
6. B. Courcelle, J. Engelfriet and G. Rozenberg, "Handle-rewriting hypergraphs grammars" J. Comput. System Sci. 46 (1993) 218-270.
7. B. Courcelle, J.A. Makowsky and U. Rotics, "Linear time solvable optimization problems on graphs of bounded clique-width" Theory of Computing Systems 33 (2000) 125-150.
8. B. Courcelle, J.A. Makowsky, and U. Rotics, "On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic" to appear in Disc. Appl. Math.
9. B. Courcelle and S. Olariu, "Upper bounds to the clique-width of graphs" Disc. Appl. Math.. 101 (2000) 77-114.
10. M.U. Gerber and D. Kobler, "Algorithms for vertex partitioning problems on graphs with fixed clique-width" submitted (2000).
11. M.C. Golumbic and U. Rotics, "On the clique-width of some perfect graph classes" Internat. J. Found. Comput. Sci 11 (2000) 423-443.
12. O. Johansson, "Clique-decomposition, NLC-decomposition, and modular decomposition - relationships and results for random graphs" Congressus Numerantium 132 (1998) 39-60.
13. D. Kobler and U. Rotics, "Polynomial algorithms for partitioning problems on graphs with fixed clique-width (Extended Abstract)" Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, (2001) 468-476.
14. 4‘s" International Journal of Foundations of Computer Science 10 (1999) 329-348.
15. E. Wanke, "k-NLC graphs and polynomial algorithms" Discrete Applied Math. 54 (1994) 251-266.