Skip to main content
Conference Proceedings

The pathwidth and treewidth of cographs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1990) 447 LNCS 301-309
DOI: 10.1007/3-540-52846-6_99
25Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a cograph and build a corresponding path-decomposition is given.

Cite

CITATION STYLE

APA

Bodlaender, H. L., & Möhring, R. H. (1990). The pathwidth and treewidth of cographs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 447 LNCS, pp. 301–309). Springer Verlag. https://doi.org/10.1007/3-540-52846-6_99

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