Δ-stepping: a parallelizable shortest path algorithm
From MaRDI portal
Publication:4820907
DOI10.1016/S0196-6774(03)00076-2zbMATH Open1091.68560MaRDI QIDQ4820907FDOQ4820907
Authors: Ulrich Meyer, Peter Sanders 
Publication date: 1 October 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1305103
- Computational Science – ICCS 2005
- scientific article; zbMATH DE number 1222607
- A Randomized Parallel Algorithm for Single-Source Shortest Paths
- scientific article; zbMATH DE number 56471
- A parallel shortest path algorithm
- Faster parallel algorithm for approximate shortest path
- Finding the \(k\) shortest paths in parallel
- Finding the \(k\) shortest paths in parallel
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cited In (7)
- Delta-stepping synchronous parallel model
- Title not available (Why is that?)
- A parallel bio-inspired shortest path algorithm
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
- Linear-algebraic implementation of Fibonacci heap
- Via Detours to I/O-Efficient Shortest Paths
- Single-source shortest paths with the parallel boost graph library
This page was built for publication: Δ-stepping: a parallelizable shortest path algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4820907)
