Search For Minimal Paths In Modified Networks

Publisher:
Elsevier Sci Ltd
Publication Type:
Journal Article
Citation:
Reliability Engineering & System Safety, 2002, 75 (3), pp. 389 - 395
Issue Date:
2002-01
Full metadata record
Files in This Item:
Filename Description Size
2010004137OK.pdf120.33 kB
Adobe PDF
The problem of searching for all minimal paths (MPs) in a network obtained by modifying the original network, e.g. for network expansion or reinforcement, is discussed and solved in this study. The existing best-known method to solve this problem was a s
Please use this identifier to cite or link to this item: