The Pathwidth and Treewidth of Cographs
- 1 May 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 6 (2) , 181-188
- https://doi.org/10.1137/0406014
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Better algorithms for the pathwidth and treewidth of graphsPublished by Springer Nature ,1991
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Nonconstructive tools for proving polynomial-time decidabilityJournal of the ACM, 1988
- Dynamic programming on graphs with bounded treewidthPublished by Springer Nature ,1988
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Searching and pebblingTheoretical Computer Science, 1986
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- Interval graphs and seatchingDiscrete Mathematics, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Complement reducible graphsDiscrete Applied Mathematics, 1981