Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel. The Max-Flow Min-Cut theorem for countable networks. Journal of Combinatorial Theory, Series A, 101(1):1-17, 2011. [doi]
@article{AharoniBGPS11,
title = {The Max-Flow Min-Cut theorem for countable networks},
author = {Ron Aharoni and Eli Berger and Agelos Georgakopoulos and Amitai Perlstein and Philipp Sprüssel},
year = {2011},
doi = {10.1016/j.jctb.2010.08.002},
url = {http://dx.doi.org/10.1016/j.jctb.2010.08.002},
tags = {data-flow},
researchr = {https://researchr.org/publication/AharoniBGPS11},
cites = {0},
citedby = {0},
journal = {Journal of Combinatorial Theory, Series A},
volume = {101},
number = {1},
pages = {1-17},
}