"Maximum flow in probabilistic graphs-the discrete case."

James R. Evans (1976)

> Home

Details and statistics

DOI: 10.1002/NET.3230060208

access: closed

type: Journal Article

metadata version: 2023-09-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Evans76
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Evans76
James R. Evans:
Maximum flow in probabilistic graphs-the discrete case. Networks 6(2): 161-183 (1976)

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.