Skip to main content
Conference Proceedings

Deciding clique-width for graphs of bounded tree-width (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2125 87-98
DOI: 10.1007/3-540-44634-6_9
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that there exists a linear time algorithm for decidingwhether a graph of bounded tree-width has clique-width k for some fixed integer k.

Cite

CITATION STYLE

APA

Espelage, W., Gurski, F., & Wanke, E. (2001). Deciding clique-width for graphs of bounded tree-width (Extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2125, pp. 87–98). Springer Verlag. https://doi.org/10.1007/3-540-44634-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free