Abstract
Meyer as well as Goldberg recently described algorithms that solve the single-source shortest-paths problem in linear average time on graphs with random edge lengths drawn from the uniform distribution on [0,1]. This note points out that the same result can be obtained through simple combinations of standard data structures and with a trivial probabilistic analysis.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hagerup, T. Simpler Computation of Single-Source Shortest Paths in Linear Average Time. Theory Comput Syst 39, 113–120 (2006). https://doi.org/10.1007/s00224-005-1260-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-005-1260-0