Flow Networks and the Min-Cut-Max-Flow Theorem

Peter Lammich 🌐 and S. Reza Sefidgar

June 1, 2017

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


We present a formalization of flow networks and the Min-Cut-Max-Flow theorem. Our formal proof closely follows a standard textbook proof, and is accessible even without being an expert in Isabelle/HOL, the interactive theorem prover used for the formalization.


BSD License


Session Flow_Networks