Bounding all-terminal reliability in computer networks
- 1 January 1988
- Vol. 18 (1), 1-12
- https://doi.org/10.1002/net.3230180102
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The Leggett bounds for network reliabilityIEEE Transactions on Circuits and Systems, 1985
- The most reliable series-parallel networksNetworks, 1985
- Network reliability and the factoring theoremNetworks, 1983
- Polynomial algorithms for estimating network reliabilityNetworks, 1982
- A recursive algorithm for finding reliability measures related to the connection of nodes in a graphNetworks, 1980
- Analysis and Design of Reliable Computer NetworksIEEE Transactions on Communications, 1972
- Network reliability analysis: Part INetworks, 1971
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961
- The dissection of rectangles into squaresDuke Mathematical Journal, 1940
- Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wirdAnnalen der Physik, 1847