Network reliability and the factoring theorem
- 1 March 1983
- Vol. 13 (1) , 107-120
- https://doi.org/10.1002/net.3230130107
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Combinatorial properties of directed graphs useful in computing network reliabilityNetworks, 1981
- A recursive algorithm for finding reliability measures related to the connection of nodes in a graphNetworks, 1980
- Complexity of network reliability computationsNetworks, 1980
- Exact calculation of computer network reliabilityNetworks, 1974
- 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
- Analysis and Design of Survivable NetworksIEEE Transactions on Communications, 1970
- An introduction to chromatic polynomialsJournal of Combinatorial Theory, 1968
- Analysis of Probabilistic NetworksIEEE Transactions on Communications, 1964
- Multi-Component Systems and Structures and Their ReliabilityTechnometrics, 1961