Deciding Clique-Width for Graphs of Bounded Tree-Width

Authors

  • Wolfgang Espelage
  • Frank Gurski
  • Egon Wanke

DOI:

https://doi.org/10.7155/jgaa.00065

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.

Downloads

Download data is not yet available.

Downloads

Published

2003-01-01

How to Cite

Espelage, W., Gurski, F., & Wanke, E. (2003). Deciding Clique-Width for Graphs of Bounded Tree-Width. Journal of Graph Algorithms and Applications, 7(2), 141–180. https://doi.org/10.7155/jgaa.00065

Issue

Vol. 7 No. 2 (2003): Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001

Section

Articles

Categories

License

Copyright (c) 2003 Wolfgang Espelage, Frank Gurski, Egon Wanke

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.