A new approach for enumerating minimal cut-sets in a network

This paper deals with the enumeration of all minimal cut sets separating an undirected graph into two sub-graphs. The algorithm does not enumerate trees or spanning trees as a first step. This approach has yielded an algorithm which generates minimal cut sets at O(½n(n-1)), where n is the number of vertices in the graph, computational effort per cut set. Formal proofs of the algorithm and its complexity are presented. Results of some computational experience show that, a) this algorithm is appreciably faster than previous algorithms, and b) can handle much larger graphs due to less memory requirements