Search for all d-Mincuts of a limited-flow network

In this presentation, we developed an intuitive algorithm based on some simple concepts that were found in this study. It is more efficient than the best-known existing algorithm. The computational complexity of the proposed algorithm is analyzed and compared with the existing methods. One example is illustrated to show how all d-MCs are generated by our proposed algorithm. As evidence of the utility of the proposed approach, extensive computational results on random test problems are presented. Our results compare favorably with previously developed algorithms in the literature.