Cutset Analysis of Networks Using Basic Minimal Paths and Network Decomposition
- 1 October 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-34 (4) , 303-307
- https://doi.org/10.1109/TR.1985.5222169
Abstract
The concept of basic minimal paths has been introduced, and its use in deducing the node cutsets of a network was described. This 3 paper deals with two important aspects of basic minimal paths: 1) the deduction of link cutsets from node cutsets, and 2) reduction of computational requirements in deducing the basic minimal paths using network decomposition.Keywords
This publication has 10 references indexed in Scilit:
- A New Technique in Minimal Path and Cutset EvaluationIEEE Transactions on Reliability, 1985
- Using the Decomposition-Tree of a Network in Reliability ComputationIEEE Transactions on Reliability, 1983
- Reliability Evaluation by Network DecompositionIEEE Transactions on Reliability, 1982
- RESIN, A Desktop-Computer Program for Finding Cut-SetsIEEE Transactions on Reliability, 1981
- System-Reliability Evaluation Techniques for Complex/Large SystemsߞA ReviewIEEE Transactions on Reliability, 1981
- Equivalence of a Nonoriented Line and a Pair of Oriented Lines in a NetworkIEEE 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
- An Efficient Algorithm for Deducing the Minimal Cuts and Reliability Indices of a General Network ConfigurationIEEE Transactions on Reliability, 1976
- Bayesian Decomposition Method for Computing the Reliability of an Oriented NetworkIEEE Transactions on Reliability, 1976