Δ-stepping: a parallelizable shortest path algorithm

DOI10.1016/S0196-6774(03)00076-2zbMath1091.68560MaRDI QIDQ4820907

Ulrich Meyer, Peter Sanders

Publication date: 1 October 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

nonrandom edge weights

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (3)

A parallel bio-inspired shortest path algorithm ⋮ Via Detours to I/O-Efficient Shortest Paths ⋮ Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models

This page was built for publication: Δ-stepping: a parallelizable shortest path algorithm