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. © Springer-Verlag 2004.
Cite
CITATION STYLE
Hagerup, T. (2004). Simpler computation of single-source shortest paths in linear average time. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2996, 362–369. https://doi.org/10.1007/978-3-540-24749-4_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
