Enumeration of all simple paths in a communication network
- 1 January 1980
- journal article
- Published by Elsevier in Microelectronics Reliability
- Vol. 20 (4) , 419-426
- https://doi.org/10.1016/0026-2714(80)90584-3
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Determination of Tie Sets and Cut Sets for a System Without FeedbackIEEE Transactions on Reliability, 1977
- A Simple Method for Reliability Evaluation of a Communication SystemIEEE Transactions on Communications, 1975
- A Method for Computing Complex System ReliabilityIEEE Transactions on Reliability, 1972
- A Fast Recursive Algorithm to Calculate the Reliability of a Communication NetworkIEEE Transactions on Communications, 1972
- Analysis and Design of Reliable Computer NetworksIEEE Transactions on Communications, 1972
- Computer-Aided Reliability Analysis of Complicated NetworksIEEE Transactions on Reliability, 1972
- 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
- On finding the simple paths and circuits in a graphIEEE Transactions on Circuit Theory, 1968