An improved Dijkstra’s shortest path algorithm for sparse network
- 1 February 2007
- journal article
- Published by Elsevier BV in Applied Mathematics and Computation
- Vol. 185 (1), 247-254
- https://doi.org/10.1016/j.amc.2006.06.094
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Improved algorithm for all pairs shortest pathsInformation Processing Letters, 2004
- PRACTICAL EFFICIENCY OF THE LINEAR-TIME ALGORITHM FOR THE SINGLE SOURCE SHORTEST PATH PROBLEMJournal of the Operations Research Society of Japan, 2000
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2MessagesJournal of Algorithms, 1997
- Sorting in linear time?Published by Association for Computing Machinery (ACM) ,1995
- Faster Scaling Algorithms for Network ProblemsSIAM Journal on Computing, 1989
- Shortest path algorithmsAnnals of Operations Research, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- 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