Minimal Triangulations for Graphs with “Few” Minimal Separators
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 344-355
- https://doi.org/10.1007/3-540-68530-8_29
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Algorithms for weakly triangulated graphsDiscrete Applied Mathematics, 1995
- How to use the minimal separators of a graph for its chordal triangulationPublished by Springer Nature ,1995
- Finding all minimal separators of a graphPublished by Springer Nature ,1994
- The ESA '93 ProceedingsPublished by Springer Nature ,1994
- Computing treewidth and minimum fill-in: All you need are the minimal separatorsPublished by Springer Nature ,1993
- Treewidth and pathwidth of permutation graphsPublished by Springer Nature ,1993
- Treewidth of circle graphsPublished by Springer Nature ,1993
- An Introduction to Chordal Graphs and Clique TreesPublished by Springer Nature ,1993
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Weakly triangulated graphsJournal of Combinatorial Theory, Series B, 1985