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.

No reviews for this publication, yet.