The Max-Flow Min-Cut theorem for countable networks - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Ron Aharoni' in GoogleThis author has not been identified. Look up 'Eli Berger' in GoogleThis author has not been identified. Look up 'Agelos Georgakopoulos' in GoogleThis author has not been identified. Look up 'Amitai Perlstein' in GoogleThis author has not been identified. Look up 'Philipp Sprüssel' in Google

runs on WebDSL