Pages that link to "Item:Q1722647"
From MaRDI portal
The following pages link to Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647):
Displayed 7 items.
- Prpu_Maxflow (Q53730) (← links)
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory (Q2102926) (← links)
- From LCF to Isabelle/HOL (Q2280211) (← links)
- Local Reasoning for Global Graph Properties (Q5041096) (← links)
- Trustworthy Graph Algorithms (Invited Talk) (Q5092359) (← links)
- (Q5875431) (← links)