A new algorithm for finding all minimal cuts in modified networks
- Publication Type:
- Journal Article
- Citation:
- International Journal of Innovative Computing, Information and Control, 2012, 8 (1 A), pp. 419 - 430
- Issue Date:
- 2012-01-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
 | 2011001626OK.pdf | 90.24 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Evaluating network reliability is an important topic in the planning, designing and control of network systems. Modifications are common for network expansion or reinforcement evaluation and planning. A modified 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 modified 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 find all MCs in a modified network using the information of all the MCs in the corresponding original network. © 2012 ICIC International.
Please use this identifier to cite or link to this item: