Edmonds-Karp
From MaRDI portal
Software:40262
swMATH28548MaRDI QIDQ40262FDOQ40262
Author name not available (Why is that?)
Cited In (9)
- 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
- Title not available (Why is that?)
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
- Title not available (Why is that?)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
This page was built for software: Edmonds-Karp
