Listing all Minimal Separators of a Graph
- 1 June 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (3) , 605-613
- https://doi.org/10.1137/s009753979427087x
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- 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
- Treewidth of Chordal Bipartite GraphsJournal of Algorithms, 1995
- Efficient Algorithms for Listing Combinatorial StructuresPublished by Cambridge University Press (CUP) ,1993
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Decomposition by clique separatorsDiscrete Mathematics, 1985
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- An algorithm for finding clique cut-setsInformation Processing Letters, 1981
- Algorithms on clique separable graphsDiscrete Mathematics, 1977