Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph
Ulrich R. Abel, R. Bicker · IEEE Transactions on Reliability · 1982
An efficient enumeration algorithm generates all minimal cut-sets separating a special vertex pair in an undirected graph. The algorithm is based on a blocking mechanism that guarantees that every minimal cut-set between the two specified vertices is generated exactly once. The algorithm is intended for computer implementation, and computational times are provided.