A note on "A simple algorithm to search for all MCs in networks"

TL;DR

This paper critiques Yeh's proposed algorithm for finding all minimal cuts in undirected networks, demonstrates its flaw with an example, and provides a corrected version of the algorithm.

Contribution

It identifies a defect in Yeh's algorithm and introduces a corrected, reliable algorithm for finding all minimal cuts in undirected graphs.

Findings

Yeh's algorithm is flawed and produces incorrect results.

A corrected algorithm is proposed and validated.

The corrected algorithm reliably finds all minimal cuts.

Abstract

Recently, Yeh [Yeh, WC. (2006). A simple algorithm to search for all MCs in networks. European Journal of Operational Research, 174, 1694{1705.] has proposed a simple algorithm to find all the Minimal Cuts in an undirected graph. However, the algorithm does not work properly. Here, using an example, a defect of this algorithm is illustrated, and then the corresponding result is shown to be incorrect. Moreover, a correct version of the algorithm is established.