A New Algorithm For Generating Minimal Cut Sets In K-Out-Of-N Networks

Elsevier Sci Ltd
Publication Type:
Journal Article
Reliability Engineering & System Safety, 2006, 91 (1), pp. 36 - 43
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010004118OK.pdf177.89 kB
Adobe PDF
Evaluating the network reliability is an important topic in the planning, designing, and control of systems. A k-out-of-n network is a special network in that some nodes must receive at least k (> 1) flows from all of their input edges (n). In real-life
Please use this identifier to cite or link to this item: