An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network
- 1 January 1987
- journal article
- Published by Elsevier in Microelectronics Reliability
- Vol. 27 (3) , 437-441
- https://doi.org/10.1016/0026-2714(87)90458-6
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Methods for global reliability evaluation of any large complex systemReliability Engineering, 1987
- Minimal pathset and minimal cutsets using search techniqueMicroelectronics Reliability, 1982
- Enumeration of all simple paths in a communication networkMicroelectronics Reliability, 1980
- Determination of Tie Sets and Cut Sets for a System Without FeedbackIEEE Transactions on Reliability, 1977
- Computer Program for Approximating the Reliability Characteristics of Acyclic Directed GraphsIEEE Transactions on Reliability, 1977
- Computer Program for Approximating System Reliability - Part IIIEEE Transactions on Reliability, 1971
- An Algorithm for the Reliability Evaluation of Redundant NetworksIEEE Transactions on Reliability, 1970
- A Computer Program for Approximating System ReliabilityIEEE Transactions on Reliability, 1970
- An Algorithm to Determine the Reliability of a Complex SystemIEEE Transactions on Reliability, 1969