Correctness and Complexity of BMSSP in Isabelle/HOL by Arthur Freitas Ramos, David Barros Hulak and Ruy Jose Guerra Barretto de Queiroz Jun 12
Correctness of a Set-based Algorithm for Computing Strongly Connected Components of a Graph by Stephan Merz and Vincent Trélat Aug 17
Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra by Peter Lammich and Tobias Nipkow Jun 25
Kruskal's Algorithm for Minimum Spanning Forest by Maximilian P. L. Haslbeck, Peter Lammich and Julian Biendarra Feb 14
Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm by Peter Lammich May 28
Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement by Viorel Preoteasa and Ralph-Johan Back May 28