First‐and second‐order bounds on terminal reliability

This publication has 11 references indexed in Scilit:

• 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
• An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
  Journal of the ACM, 1980
• Complexity of network reliability computations
  Networks, 1980
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
  IEEE Transactions on Reliability, 1978
• MINOS. A Large-Scale Nonlinear Programming System (For Problems With Linear Constraints). User's Guide.
  Published by Defense Technical Information Center (DTIC) ,1977
• Sequential Bounding of the Reliability of a Stochastic Network
  Operations Research, 1976
• Exact calculation of computer network reliability
  Networks, 1974
• A Boolean algebra method for computing the terminal reliability in a communication network
  IEEE Transactions on Circuit Theory, 1973
• Best Possible Inequalities for the Probability of a Logical Function of Events
  The American Mathematical Monthly, 1965