Dijkstra's Shortest Path Algorithm

MaRDI QIDQ7361202FDO

Authors Benedikt Nordhoff, Peter Lammich

Publication date 30 January 2012

Cites work

• A note on two problems in connexion with graphs
• Code generation via higher-order rewrite systems
• Unnamed Publication
• Imperative Functional Programming with Isabelle/HOL
• Isabelle/HOL. A proof assistant for higher-order logic
• Modular compiler verification. A refinement-algebraic approach advocating stepwise abstraction
• The Isabelle collections framework

Cited in

(3)

• Verified Construction of Static Single Assignment Form
• The Imperative Refinement Framework
• The Königsberg Bridge Problem and the Friendship Theorem

This page was built for software: Dijkstra's Shortest Path Algorithm