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.
@article{ProvanB83,
title = {The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected},
author = {J. Scott Provan and Michael O. Ball},
year = {1983},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/ProvanB83},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {12},
number = {4},
pages = {777-788},
}