book chapter · Lecture notes in computer science · 2001

Deciding Clique-Width for Graphs of Bounded Tree-Width

Wolfgang Espelage, Frank Gurski, Egon Wanke

Cited by 7Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Espelage, W., Gurski, F., & Wanke, E. (2001). Deciding Clique-Width for Graphs of Bounded Tree-Width. Lecture notes in computer science, 87–98. https://doi.org/10.1007/3-540-44634-6_9

MLA 9

Espelage, Wolfgang, et al. “Deciding Clique-Width for Graphs of Bounded Tree-Width.” Lecture notes in computer science, 2001, pp. 87–98, https://doi.org/10.1007/3-540-44634-6_9.

Chicago

Espelage, Wolfgang, Frank Gurski, and Egon Wanke. 2001. “Deciding Clique-Width for Graphs of Bounded Tree-Width.” Lecture notes in computer science: 87–98. https://doi.org/10.1007/3-540-44634-6_9.

Harvard

Espelage, W., Gurski, F. and Wanke, E. (2001) ‘Deciding Clique-Width for Graphs of Bounded Tree-Width’, Lecture notes in computer science, pp. 87–98. Available at: https://doi.org/10.1007/3-540-44634-6_9.

BibTeX

@incollection{espelage2001deciding,
  title = {{Deciding Clique-Width for Graphs of Bounded Tree-Width}},
  author = {Espelage, Wolfgang and Gurski, Frank and Wanke, Egon},
  booktitle = {Lecture notes in computer science},
  pages = {87--98},
  year = {2001},
  doi = {10.1007/3-540-44634-6_9}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.