Treewidth and pathwidth of permutation graphs
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 114-125
- https://doi.org/10.1007/3-540-56939-1_66
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Treewidth of chordal bipartite graphsPublished by Springer Nature ,1993
- Better algorithms for the pathwidth and treewidth of graphsPublished by Springer Nature ,1991
- Finding minimal forbidden minors using a finite congruencePublished by Springer Nature ,1991
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- On Comparability and Permutation GraphsSIAM Journal on Computing, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Diperfect GraphsNorth-Holland Mathematics Studies, 1984
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962