Journal of Graph Algorithms and Applications
http://jgaa.info ISSN: 1526-1719
|
DOI: 10.7155/jgaa.00065 Deciding Clique-Width for Graphs of Bounded Tree-Width Wolfgang Espelage , Frank Gurski , and Egon Wanke 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.
|
Revised: February 2003. Revised: July 2002. Submitted: October 2001. Communicated by Giuseppe Liotta and Ioannis Tollis |
| Journal of Graph Algorithms and Applications |