Sciweavers

WADS
2001
Springer

Deciding Clique-Width for Graphs of Bounded Tree-Width

13 years 8 months ago
Deciding Clique-Width for Graphs of Bounded Tree-Width
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. Communicated by Giuseppe Liotta and Ioannis G. Tollis: submitted October 2001; revised July 2002 and February 2003. The work of the second author was supported by the German Research Association (DFG) grant WA 674/9-2.
Wolfgang Espelage, Frank Gurski, Egon Wanke
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where WADS
Authors Wolfgang Espelage, Frank Gurski, Egon Wanke
Comments (0)