MathSciNet Relay Station
MathSciNet bibliographic data
MR721012 68R10 (05C40 68Q25)
Provan, J. Scott; Ball, Michael O. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12 (1983), no. 4, 777–788.
Article
 
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2017, American Mathematical Society
Privacy Statement