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


Title: Flow Networks and the Min-Cut-Max-Flow Theorem
Authors: Peter Lammich and S. Reza Sefidgar
Submission date: 2017-06-01
Abstract: 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.
  author  = {Peter Lammich and S. Reza Sefidgar},
  title   = {Flow Networks and the Min-Cut-Max-Flow Theorem},
  journal = {Archive of Formal Proofs},
  month   = jun,
  year    = 2017,
  note    = {\url{https://isa-afp.org/entries/Flow_Networks.html},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Depends on: CAVA_Automata, DFS_Framework, Program-Conflict-Analysis, Refine_Imperative_HOL
Used by: EdmondsKarp_Maxflow, Prpu_Maxflow
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.