A New Algorithm for Finding All Minimal Cuts in Modified Networks

I C I C International
Publication Type:
Journal Article
International Journal Of Innovative Computing Information And Control, 2012, 8 (1(A)), pp. 419 - 430
Issue Date:
Full metadata record
Files in This Item:
Filename Description SizeFormat
2011001626OK.pdf90.24 kBAdobe PDF
Evaluating network reliability is an important topic in the planning, designing and control of network systems. Modications are common for network expansion or reinforcement evaluation and planning. A modied network is an updated network after inserting a branch string (a special path) between two nodes in the original network. The problem of searching all minimal cuts (MCs) in a modied network is discussed and solved in this study. The proposed algorithm is easier to understand and implement than the existing known related algorithms. The accuracy of the proposed algorithm will be validated. The computational complexity of the proposed algorithm is analyzed and compared with the existing best-known methods. One benchmark example is illustrated to show how to nd all MCs in a modied network using the information of all the MCs in the corresponding original network.
Please use this identifier to cite or link to this item: