On the relationship between clique-width and treewidth

SIAM Journal on Computing

Volumn 34, Issue 4, 2005, Pages 825-847

  Corneil, Derek G ^a   Rotics, Udi ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b NETANYA ACADEMIC COLLEGE   (Israel)

Author keywords

Clique width; Treewidth

Indexed keywords

ALGORITHMS; BOUNDARY LAYERS; MATHEMATICAL MODELS; POLYNOMIALS;

CLIQUE-WIDTH; POLYNOMIAL TIME ALGORITHM; TREEWIDTH;

GRAPH THEORY;

EID: 24344452559     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701385351     Document Type: Article

References (12)

1. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 277-284.
2. H. L. BODLAENDER, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305-1317.
3. D. G. CORNEIL, M. HABIB, J. M. LANLIGNEL, B. REED, AND U. ROTICS, Polynomial time recognition of clique-width ≤ 3 graphs, submitted for publication. An extended abstract has appeared in Proceedings of Latin American Theoretical Informatics, LATIN 2000, Lecture Notes in Comput. Sci. 1776, Springer-Verlag, Berlin, 2000, pp. 126-134.
4. D. G. CORNEIL, Y. PERL, AND L. K. STEWART, A linear recognition algorithm for cographs, SIAM J. Comput., 14 (1985), pp. 926-934.
5. B. COURCELLE, J. ENGELFRIET, AND G. ROZENBERG, Handle-rewriting hypergraph grammars, J. Comput. System Sci., 46 (1993), pp. 218-270.
6. B. COURCELLE, J. A. MAKOWSKY, AND U. ROTICS, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst., 33 (2000), pp. 125-150.
7. B. COURCELLE, J. A. MAKOWSKY, AND U. ROTICS, On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic, Discrete Appl. Math., 108 (2001), pp. 23-52.
8. B. COURCELLE AND S. OLARIU, Upper bounds to the clique-width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
9. W. ESPELAGE, F. GURSKI, AND E. WANKE, Deciding clique-width for graphs of bounded tree-width, J. Graph Algorithms Appl., 7 (2003), pp. 141-180.
10. M. U. GERBER AND D. KOBLER, Algorithms for vertex partitioning problems on graphs with fixed clique-width, Theoret. Comput. Sci., 299 (2003), pp. 719-734.
11. D. KOBLER AND U. ROTICS, Edge dominating set and colorings on graphs with fixed clique-width, Discrete Appl. Math., 126 (2003), pp. 197-221.
12. 4's, Internat. J. Found. Comput. Sci., 10 (1999), pp. 329-348.