Dijkstra Shortest Path
From MaRDI portal
Software:40264
swMATH28550MaRDI QIDQ40264FDOQ40264
Author name not available (Why is that?)
Cited In (10)
- Efficient verification of imperative programs using auto2
- Refinement to imperative HOL
- Formalizing the Edmonds-Karp Algorithm
- A framework for the verification of certifying computations
- A graph library for Isabelle
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Refinement to Imperative/HOL
- Automatic refinement to efficient data structures: a comparison of two approaches
- Title not available (Why is that?)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
This page was built for software: Dijkstra Shortest Path
