Bounding all-terminal reliability in computer networks

This publication has 21 references indexed in Scilit:

• The Leggett bounds for network reliability
  IEEE Transactions on Circuits and Systems, 1985
• The most reliable series-parallel networks
  Networks, 1985
• Network reliability and the factoring theorem
  Networks, 1983
• Polynomial algorithms for estimating network reliability
  Networks, 1982
• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
  Networks, 1980
• Analysis and Design of Reliable Computer Networks
  IEEE Transactions on Communications, 1972
• Network reliability analysis: Part I
  Networks, 1971
• Edge-Disjoint Spanning Trees of Finite Graphs
  Journal of the London Mathematical Society, 1961
• The dissection of rectangles into squares
  Duke Mathematical Journal, 1940
• Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird
  Annalen der Physik, 1847