The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

This publication has 7 references indexed in Scilit:

• Calculating bounds on reachability and connectedness in stochastic networks
  Networks, 1983
• Bounds on the Reliability Polynomial for Shellable Independence Systems
  SIAM Journal on Algebraic Discrete Methods, 1982
• Complexity of network reliability computations
  Networks, 1980
• The Complexity of Enumeration and Reliability Problems
  SIAM Journal on Computing, 1979
• Computing the Reliability of Complex Networks
  SIAM Journal on Applied Mathematics, 1977
• On some direct encodings of nondeterministic Turing machines operating in polynomial time into p-complete problems
  ACM SIGACT News, 1974
• 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