Polynomial algorithms for estimating network reliability

This publication has 9 references indexed in Scilit:

• Complexity of network reliability computations
  Networks, 1980
• The Complexity of Enumeration and Reliability Problems
  SIAM Journal on Computing, 1979
• Rational search
  Information Processing Letters, 1979
• Efficient search for rationals
  Information Processing Letters, 1979
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• Matroids and the greedy algorithm
  Mathematical Programming, 1971
• Optimum branchings
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
• Best Possible Inequalities for the Probability of a Logical Function of Events
  The American Mathematical Monthly, 1965
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965