Computer science/Algorithms/Graph

Subject Classification

ACM: Theory of computation~Graph algorithms analysis

AMS: Combinatorics / Graph theory / Graph algorithms

2024

Difference Bound Matrices

by Simon Wimmer and Peter Lammich

Aug 14

Worklist Algorithms

by Simon Wimmer and Peter Lammich

Aug 09

Derandomization with Conditional Expectations

by Emin Karayel

Mar 24

2023

Tree Enumeration

by Nils Cremer

May 09

Expander Graphs

by Emin Karayel

Mar 03

2022

Correctness of a Set-based Algorithm for Computing Strongly Connected Components of a Graph

by Stephan Merz and Vincent Trélat

Aug 17

2020

Relational Minimum Spanning Tree Algorithms

by Walter Guttmann and Nicolas Robinson-O’Brien

Dec 08

2019

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

2017

Formalizing Push-Relabel Algorithms

by Peter Lammich and S. Reza Sefidgar

Jun 01

The Floyd-Warshall Algorithm for Shortest Paths

by Simon Wimmer and Peter Lammich

May 08

2016

Formalizing the Edmonds-Karp Algorithm

by Peter Lammich and S. Reza Sefidgar

Aug 12

A Framework for Verifying Depth-First Search Algorithms

by Peter Lammich and René Neumann

Jul 05

2014

Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm

by Peter Lammich

May 28

Transitive closure according to Roy-Floyd-Warshall

by Makarius Wenzel

May 23

2012

Executable Transitive Closures

by René Thiemann

Feb 29

Dijkstra's Shortest Path Algorithm

by Benedikt Nordhoff and Peter Lammich

Jan 30

2011

Executable Transitive Closures of Finite Relations

by Christian Sternagel and René Thiemann

Mar 14

2010

Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement

by Viorel Preoteasa and Ralph-Johan Back

May 28

2004

Depth First Search

by Toshiaki Nishihara and Yasuhiko Minamide

Jun 24