The Max-Flow Min-Cut theorem for countable networks
From MaRDI portal
Publication:618031
DOI10.1016/J.JCTB.2010.08.002zbMath1221.05186arXiv0911.4003OpenAlexW2008634162MaRDI QIDQ618031
Ron Aharoni, Eli Berger, Amitai Perlstein, Philipp Sprüssel, Angelos Georgakopoulos
Publication date: 14 January 2011
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4003
Related Items (13)
A General Framework for Probabilistic Characterizing Formulae ⋮ A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems ⋮ Unnamed Item ⋮ Borel circle squaring ⋮ A theory of composition for differential obliviousness ⋮ Random walks in random Dirichlet environment are transient in dimension \(d \geq 3\) ⋮ Algebraic flow theory of infinite graphs ⋮ Random walks in Dirichlet environment: an overview. Dedicated to Dominique Bakry on the occasion of his 60th birthday ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ On packing and covering polyhedra in infinite dimensions ⋮ Probabilistic Functions and Cryptographic Oracles in Higher Order Logic ⋮ A greedy algorithm for finding maximum spanning trees in infinite graphs ⋮ A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
Cites Work
This page was built for publication: The Max-Flow Min-Cut theorem for countable networks
