A Recursive Method Based on Case Analysis for Computing Network Terminal Reliability
- 1 August 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 26 (8) , 1166-1177
- https://doi.org/10.1109/tcom.1978.1094215
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Synthesis of Available NetworksIEEE Transactions on Reliability, 1976
- A Simple Method for Reliability Evaluation of a Communication SystemIEEE Transactions on Communications, 1975
- A Fast Algorithm for Reliability EvaluationIEEE Transactions on Reliability, 1975
- Exact calculation of computer network reliabilityNetworks, 1974
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- A Boolean algebra method for computing the terminal reliability in a communication networkIEEE Transactions on Circuit Theory, 1973
- A Fast Recursive Algorithm to Calculate the Reliability of a Communication NetworkIEEE Transactions on Communications, 1972
- Isomorphism of Planar Graphs (Working Paper)Published by Springer Nature ,1972
- Separable graphs, planar graphs and web grammarsInformation and Control, 1970
- Analysis of Switching NetworksBell System Technical Journal, 1955