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.

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.

License

BSD License

Topics

Session Flow_Networks

Depends on

Used by

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{https://isa-afp.org/entries/Flow_Networks.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: