A note on "A simple algorithm to search for all MCs in networks"
Optimization and Control
2014-01-03 v1
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.
Keywords
Cite
@article{arxiv.1401.0382,
title = {A note on "A simple algorithm to search for all MCs in networks"},
author = {Majid Forghani-elahabad and Nezam Mahdavi-Amiri},
journal= {arXiv preprint arXiv:1401.0382},
year = {2014}
}
Comments
11 pages, 1 figures, 2algorithms