A New Technique in Minimal Path and Cutset Evaluation
- 1 June 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-34 (2) , 136-143
- https://doi.org/10.1109/tr.1985.5221974
Abstract
This paper presents a new technique for deducing the minimal paths and cutsets of a general network. A powerful concept of reducing the total number of minimal paths to its basic minimal paths is introduced. This concept reduces the computational time and required storage in deducing the minimal cutsets. A new technique for evaluating minimal cutsets has been adopted. Examples demonstrate the power of the technique in reducing the computational requirements as compared to the conventional method, and show that the task for analysing large systems now becomes trival.Keywords
This publication has 5 references indexed in Scilit:
- Approaches to Comparing Cut-Set Enumeration AlgorithmsIEEE Transactions on Reliability, 1979
- An Improved Algorithm for Network ReliabilityIEEE Transactions on Reliability, 1979
- Enumeration of All Minimal Cut-Sets for a Node Pair in a GraphIEEE Transactions on Reliability, 1979
- An Efficient Method for Reliability Evaluation of a General NetworkIEEE Transactions on Reliability, 1978
- Relationship Between Minimal Path Sets and Cut SetsIEEE Transactions on Reliability, 1978