Improving reliability bounds in computer networks

This publication has 10 references indexed in Scilit:

• A dual ascent approach for steiner tree problems on a directed graph
  Mathematical Programming, 1984
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
  SIAM Journal on Computing, 1983
• Polynomial algorithms for estimating network reliability
  Networks, 1982
• Bounds on the Reliability Polynomial for Shellable Independence Systems
  SIAM Journal on Algebraic Discrete Methods, 1982
• The Complexity of Enumeration and Reliability Problems
  SIAM Journal on Computing, 1979
• Graph Theory with Applications
  Published by Springer Nature ,1976
• Network reliability analysis: Part I
  Networks, 1971
• Best Possible Inequalities for the Probability of a Logical Function of Events
  The American Mathematical Monthly, 1965
• 12. The Number of Simplices in a Complex
  Published by University of California Press ,1963
• Reliable circuits using less reliable relays
  Journal of the Franklin Institute, 1956