The complexity of counting cuts and of computing the probability that a graph is connected.
Saved in:
| Title: | The complexity of counting cuts and of computing the probability that a graph is connected. |
|---|---|
| Authors: | Provan, J. Scott, Ball, Michael O. |
| Source: | SIAM Journal on Computing; November 1983, Vol. 12, p777-788, 12p |
| Database: | Applied Science & Technology Source |
| ISSN: | 00975397 |
|---|---|
| DOI: | 10.1137/0212053 |
