Abstract
In this paper, first we develop an intuitive algorithm using the shortest path based upon the reformation of all MCs in the original network. Next, the computational complexity of the proposed algorithm is analyzed and compared with the existing methods. One computer example is illustrated to show how all MCs are generated in a modified network based upon reformation of all of the MCs of the corresponding original network. Scope and purpose A method is proposed to search for all minimal cuts (MCs) in a network (modified networks) obtained by modifying the original network. It can be used for reliability analysis of various modifications in an existing network for network expansion or reinforcement evaluation and planning. Analysis of our algorithm and comparison to existing best-known algorithms shows that our proposed method has the following advantages: (1) it can be used to search for all MCs without knowing all minimal paths (MPs) and MCs in advance. (2) it is simple and more effective in finding and verifying MC candidates in modified networks than the existing methods, and (3) our method is easier to understand and implement. (C) 2000 Elsevier Science Ltd. All rights reserved.