Generating All the Minimal Separators of a Graph
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 167-172
- https://doi.org/10.1007/3-540-46784-x_17
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Listing all Minimal Separators of a GraphSIAM Journal on Computing, 1998
- Separability generalizes Dirac's theoremDiscrete Applied Mathematics, 1998
- Minimal Triangulations for Graphs with “Few” Minimal SeparatorsPublished by Springer Nature ,1998
- Efficient enumeration of all minimal separators in a graphTheoretical Computer Science, 1997
- On treewidth and minimum fill-in of asteroidal triple-free graphsTheoretical Computer Science, 1997
- Treewidth and Pathwidth of Permutation GraphsSIAM Journal on Discrete Mathematics, 1995
- Finding all minimal separators of a graphPublished by Springer Nature ,1994
- Computing treewidth and minimum fill-in: All you need are the minimal separatorsPublished by Springer Nature ,1993