Cited in
(21)- Graph theory in Coq: minors, treewidth, and isomorphisms
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- A modular first formalisation of combinatorial design theory
- A framework for the verification of certifying computations
- A graph library for Isabelle
- Infeasible paths elimination by symbolic execution techniques. Proof of correctness and preservation of paths
- CFML
- MathScheme
- VACID-0
- Dijkstra Shortest Path
- Perron Frobenius
- NASA PVS
- Girth-Chromatic
- Tame Graphs
- Maximum Cardinality Matching
- AutoCorres
- ShortestPath
- Fishers_Inequality
- Roth_Arithmetic_Progressions
- Matroids
- Latin Square
This page was built for software: Graph Theory
