Parallel algorithms for the single source shortest path problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3690676 (Why is no real title available?)
- scientific article; zbMATH DE number 3696469 (Why is no real title available?)
- scientific article; zbMATH DE number 3635515 (Why is no real title available?)
- scientific article; zbMATH DE number 3446921 (Why is no real title available?)
- A New Approach to Proving the Correctness of Multiprocess Programs
- A Note on Dijkstra's Shortest Path Algorithm
- A note on two problems in connexion with graphs
- A parallel algorithm for constructing minimum spanning trees
- Algorithm 562: Shortest Path Lengths [H]
- Computing connected components on parallel computers
- Formal verification of parallel programs
- Parallel Computations in Graph Theory
- Shortest-path algorithms: Taxonomy and annotation
- The temporal semantics of concurrent programs
- Verifying properties of parallel programs
Cited in
(3)
This page was built for publication: Parallel algorithms for the single source shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162156)