Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001
Deciding Clique-Width for Graphs of Bounded Tree-Width
Vol. 7, no. 2, pp. 141-180, 2003. Regular paper.
Abstract We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k.
Submitted: October 2001.
Revised: July 2002.
Revised: February 2003.
Communicated by Giuseppe Liotta and Ioannis G. Tollis
article (PDF)