An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- 1 October 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (4) , 619-632
- https://doi.org/10.1145/322217.322220
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a GraphJournal of the ACM, 1976
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- A Boolean algebra method for computing the terminal reliability in a communication networkIEEE Transactions on Circuit Theory, 1973
- Cut-set graph and systematic generation of separating setsIEEE Transactions on Circuit Theory, 1972
- A Computer Program for Approximating System ReliabilityIEEE Transactions on Reliability, 1970
- Optical transmittance of louver systemsJournal of the Franklin Institute, 1962