Edmonds-Karp
From MaRDI portal
Cited in
(28)- Graph theory in Coq: minors, treewidth, and isomorphisms
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- Efficient verification of imperative programs using auto2
- Refinement to imperative HOL
- Efficient verified (UN)SAT certificate checking
- Netsoft
- Autoref
- CFML
- libclang
- MLton
- GRAT
- VACID-0
- Dijkstra Shortest Path
- Collections
- Flow Networks
- CAVA LTL Modelchecker
- Refinement Monadic
- Separation Logic
- Gabow SCC
- Imperative Refinement
- Auto2_Imperative_HOL
- IEEE_Floating_Point
- MFMC_Countable
- Prpu_Maxflow
- scientific article; zbMATH DE number 7649971 (Why is no real title available?)
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
- scientific article; zbMATH DE number 7649969 (Why is no real title available?)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
This page was built for software: Edmonds-Karp
