Deciding Clique-Width for Graphs of Bounded Tree-Width

Wolfgang Espelage, Frank Gurski, Egon Wanke. Deciding Clique-Width for Graphs of Bounded Tree-Width. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Roberto Tamassia, editors, Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings. Volume 2125 of Lecture Notes in Computer Science, pages 87-98, Springer, 2001. [doi]

@inproceedings{EspelageGW01:0,
  title = {Deciding Clique-Width for Graphs of Bounded Tree-Width},
  author = {Wolfgang Espelage and Frank Gurski and Egon Wanke},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2125/21250087.htm},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/EspelageGW01%3A0},
  cites = {0},
  citedby = {0},
  pages = {87-98},
  booktitle = {Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
  editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Roberto Tamassia},
  volume = {2125},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-42423-7},
}