A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks

Andreas Lochbihler. A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks. Archive of Formal Proofs, 2016, 2016. [doi]

Abstract

Abstract is missing.