The following pages link to A graph library for Isabelle (Q2018659):
Displayed 14 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)
- A modular first formalisation of combinatorial design theory (Q2128787) (← links)
- Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
- Infeasible Paths Elimination by Symbolic Execution Techniques (Q2829242) (← links)
- Formalizing the Edmonds-Karp Algorithm (Q2829260) (← links)
- Trustworthy Graph Algorithms (Invited Talk) (Q5092359) (← links)
- (Q5875421) (← links)
- (Q5875432) (← links)
- Introduction to graph enumerations (Q6071621) (← links)
- About regular graphs (Q6071625) (← links)
- Isabelle formalisation of original representation theorems (Q6118819) (← links)
- Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL (Q6156630) (← links)
- (Q6198042) (← links)