The most reliable series-parallel networks
- 1 March 1985
- Vol. 15 (1) , 27-32
- https://doi.org/10.1002/net.3230150104
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- Calculating bounds on reachability and connectedness in stochastic networksNetworks, 1983
- Steiner trees in probabilistic networksMicroelectronics Reliability, 1983
- Series‐parallel reduction for difficult measures of network reliabilityNetworks, 1981
- Networks immune to isolated failuresNetworks, 1981
- Complexity of network reliability computationsNetworks, 1980
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979
- On simple characterizations of k-treesDiscrete Mathematics, 1974
- Analysis and Design of Reliable Computer NetworksIEEE Transactions on Communications, 1972