Flow Networks and the Min-Cut-Max-Flow Theorem (Q7361217)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Flow_Networks
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Flow Networks and the Min-Cut-Max-Flow Theorem |
AFP entry Flow_Networks |
Statements
Peter Lammich
0 references
S. Reza Sefidgar
0 references
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.
0 references
0 references
0 references
0 references
0 references
1 June 2017
0 references
Flow Networks and the Min-Cut-Max-Flow Theorem (English)
0 references
