Simpler computation of single-source shortest paths in linear average time

DOI10.1007/S00224-005-1260-0zbMath1104.68134OpenAlexW2038504986MaRDI QIDQ2432528

Torben Hagerup

Publication date: 25 October 2006

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-005-1260-0

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40)

Related Items (2)

Via Detours to I/O-Efficient Shortest Paths ⋮ A Forward-Backward Single-Source Shortest Paths Algorithm

This page was built for publication: Simpler computation of single-source shortest paths in linear average time