A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks
From MaRDI portal
Publication:6099616
DOI10.4230/lipics.itp.2021.25OpenAlexW3175141525MaRDI QIDQ6099616
Publication date: 20 June 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/13920/pdf/LIPIcs-ITP-2021-25.pdf/
Related Items (2)
CryptHOL: game-based proofs in higher-order logic ⋮ A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
This page was built for publication: A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks