Implementations of Dijkstra’s Algorithm Based on Multi-Level Buckets
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 292-327
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsJournal of Computer and System Sciences, 1994
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Shortest path algorithmsAnnals of Operations Research, 1988
- Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problemCommunications of the ACM, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- 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
- On a routing problemQuarterly of Applied Mathematics, 1958