The following pages link to Edmonds-Karp (Q40262):
Displaying 9 items.
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (Q2102926) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- Efficient verification of imperative programs using auto2 (Q2324204) (← links)
- (Q5875428) (← links)
- (Q5875431) (← links)
- Efficient verified (UN)SAT certificate checking (Q5919480) (← links)
