A Simple Shortest Path Algorithm with Linear Average Time
- 17 August 2001
- book chapter
- Published by Springer Nature
- p. 230-241
- https://doi.org/10.1007/3-540-44676-1_19
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Negative-cycle detection algorithmsMathematical Programming, 1999
- Buckets, Heaps, Lists, and Monotone Priority QueuesSIAM Journal on Computing, 1999
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path treesNetworks, 1979
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Algorithm 360: shortest-path forest with topological ordering [H]Communications of the ACM, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952