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

J. Scott Provan, Michael O. Ball. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM Journal on Computing, 12(4):777-788, 1983.

Authors

J. Scott Provan

This author has not been identified. Look up 'J. Scott Provan' in Google

Michael O. Ball

This author has not been identified. Look up 'Michael O. Ball' in Google