On the Relationship between Clique-Width and Treewidth
Treewidth is generally regarded as one of the most useful parameterizations of a graph’s construction. Clique-width is a similar parameterizations that shares one of the powerful properties of treewidth, namely: if a graph is of bounded treewidth (or clique-width), then there is a polynomial time algorithm for any graph problem expressible in Monadic Second Order Logic, using quantifiers on vertices (in the case of clique-width you must assume a clique-width parse expression is given). In studying the relationship between treewidth and clique-width, Courcelle and Olariu showed that any graph of bounded treewidth is also of bounded clique-width; in particular, for any graph G with treewidth k, the clique-width of G ≤ 4 * 2k−1 + 1.
In this paper, we improve this result to the clique-width of G ≤ 3 * 2k−1 and more importantly show that there is an exponential lower bound on this relationship. In particular, for any k, there is a graph G with treewidth = k where the clique-width of G ≥ 2[k/2]−1.
KeywordsPolynomial Time Algorithm Construction Tree Order Logic Interval Graph Parse Tree
Unable to display preview. Download preview PDF.
- 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).Google Scholar
- 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.Google Scholar
- 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. Google Scholar
- 10.M.U. Gerber and D. Kobler, “Algorithms for vertex partitioning problems on graphs with fixed clique-width” submitted (2000).Google Scholar
- 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.Google Scholar