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

Peter Lammich and S. Reza Sefidgar

1 June 2017

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.
BSD License

Depends On

Used by

Topics

Related Entries

Theories

Cite

×
@article{Flow_Networks-AFP,
  author  = {Peter Lammich and S. Reza Sefidgar},
  title   = {Flow Networks and the Min-Cut-Max-Flow Theorem},
  journal = {Archive of Formal Proofs},
  month   = June,
  year    = 2017,
  note    = {\url{http://isa-afp.org/entries/Flow_Networks.html},
            Formal proof development},
  ISSN    = {2150-914x},
}
Download