Title of article
Search for MC in modified networks
Author/Authors
Wei-Chang Yeh، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2001
Pages
8
From page
177
To page
184
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.
Keywords
Shortest path , Minimal Cuts (MCs) , Minimal Paths (MPs) , Modified network , reliability
Journal title
Computers and Operations Research
Serial Year
2001
Journal title
Computers and Operations Research
Record number
927129
Link To Document