"The Max-Flow Min-Cut theorem for countable networks."

Ron Aharoni et al. (2011)

> Home

Details and statistics

DOI: 10.1016/J.JCTB.2010.08.002

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/AharoniBGPS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/AharoniBGPS11
Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel:
The Max-Flow Min-Cut theorem for countable networks. J. Comb. Theory B 101(1): 1-17 (2011)

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.