Flow Networks
| swMATH ID: | 28552 |
| Software Authors: | Lammich, Peter; Sefidgar, S. Reza |
| Description: | Flow Networks and the Min-Cut-Max-Flow Theorem. 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 |
| Homepage: | https://www.isa-afp.org/entries/Flow_Networks.html |
| Dependencies: | Isabelle |
| Related Software: | Coq; Why3; Dijkstra Shortest Path; WhyML; Prpu_Maxflow; Gabow SCC; Archive Formal Proofs; Amortized Complexity; Refinement Monadic; Separation Logic; Edmonds-Karp; GitHub; MLton; DIMACS; HOL; Netsoft; Isar; Isabelle/HOL; Isabelle |
| Cited in: | 1 Document |
Cited by 2 Authors
| 1 | Lammich, Peter |
| 1 | Sefidgar, S. Reza |
Cited in 1 Serial
| 1 | Journal of Automated Reasoning |
Cited in 3 Fields
| 1 | Combinatorics (05-XX) |
| 1 | Computer science (68-XX) |
| 1 | Operations research, mathematical programming (90-XX) |
