An Improved Algorithm For Searching All Minimal Cuts In Modified Networks
- Publisher:
- Elsevier Sci Ltd
- Publication Type:
- Journal Article
- Citation:
- Reliability Engineering & System Safety, 2008, 93 (7), pp. 1018 - 1024
- Issue Date:
- 2008-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
2010004106OK.pdf | 207.46 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
A modified network is an updated network after inserting a branch string (a special path) between two nodes in the original network. Modifications are common for network expansion or reinforcement evaluation and planning. The problem of searching all min
Please use this identifier to cite or link to this item: