Efficient enumeration of all minimal separators in a graph
- 10 June 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 180 (1-2) , 169-180
- https://doi.org/10.1016/s0304-3975(97)83809-1
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per CutsetJournal of the ACM, 1980
- Computing connected components on parallel computersCommunications of the ACM, 1979
- Cut-set graph and systematic generation of separating setsIEEE Transactions on Circuit Theory, 1972