-stepping: A parallel single source shortest path algorithm

DOI10.1007/3-540-68530-8_33MaRDI QIDQ4252046zbMATH OpenFDO

Authors Ulrich Meyer, Peter Sanders

Publication date 13 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68530-8_33

zbMATH Keywords

\(\Delta\)-stepping algorithmBellman-Ford algorithmDial's algorithm

Mathematics Subject Classification ID

Paths and cycles (05C38) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Δ-stepping: a parallelizable shortest path algorithm
• A Randomized Parallel Algorithm for Single-Source Shortest Paths
• scientific article; zbMATH DE number 934538
• scientific article; zbMATH DE number 1863286

Cited in

(11)

• A parallel bio-inspired shortest path algorithm
• Using Selective Path-Doubling for Parallel Shortest-Path Computations
• Delta-stepping synchronous parallel model
• Single-source shortest paths with the parallel boost graph library
• A parallelization of Dijkstra's shortest path algorithm
• A Randomized Parallel Algorithm for Single-Source Shortest Paths
• scientific article; zbMATH DE number 1863286 (Why is no real title available?)
• Δ-stepping: a parallelizable shortest path algorithm
• Modern Datalog Engines
• Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances
• Insights into (k,)-shortcutting algorithms

Describes a project that uses

Uses Software

• MPI

This page was built for publication: \(\Delta\)-stepping: A parallel single source shortest path algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252046)