"The Complexity of Counting Cuts and of Computing the Probability that a ..."

J. Scott Provan, Michael O. Ball (1983)

> Home

Details and statistics

DOI: 10.1137/0212053

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ProvanB83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ProvanB83
J. Scott Provan, Michael O. Ball:
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM J. Comput. 12(4): 777-788 (1983)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.