An improved Dijkstra's shortest path algorithm for sparse network

Applied Mathematics and Computation

Volumn 185, Issue 1, 2007, Pages 247-254

  Xu, M H ^a   Liu, Y Q ^a   Huang, Q L ^a   Zhang, Y X ^a   Luan, G F ^a  

^a CHANGZHOU UNIVERSITY   (China)

Author keywords

Comparison addition model; Dijkstra's shortest path algorithm; Fibonacci heap

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; STREET TRAFFIC CONTROL;

COMPARISON-ADDITION MODEL; DIJKSTRA'S SHORTEST PATH ALGORITHM; FIBONACCI HEAP;

ALGORITHMS;

EID: 33846926749     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.06.094     Document Type: Article

References (15)

1. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, R.E. Tarjan, Faster algorithms for the shortest path problem, Technical Report CS-TR-154-88, Department of Computer Science, Princeton University, 1988.
2. A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in linear time? in: Proceedings of 27th ACM Symposium on Theory of Computing, 1995, pp. 427-436.
3. Asano Y., and Imai H. Practical efficiency of the linear-time algorithm for the single source shortest path problem. J. Oper. Res. Soc. Jpn. 43 (2000) 431-447
4. Bellman R.E. On a pouting problem. Quart. Appl. Math 16 (1958) 87-90
5. Dial R.B. Algorithm 360: shortest path forest with topological ordering. Commun. ACM 12 (1969) 632-633
6. Dijkstra E.W. A note on two problems in connection with graphs. Numer. Math. 1 (1959) 269-271
7. Ford Jr. L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton, NJ
8. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithm. J. ACM 34 3 (1987) 596-615
9. Gabow H.N., and Tarjan R.E. Faster scaling algorithms for network problems. SIAM J. Comput. (1989) 1013-1036
10. Gallo G., and Pallottino S. Shortest paths algorithm. Ann. Oper. Res. 13 (1988) 3-79
11. A.V. Goldberg, Scaling algorithms for the shortest paths problem, in: Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 222-231.
12. Han Y. Improved algorithm for all pairs shortest paths. Inform. Process. Lett. 91 (2004) 245-250
13. 2 messages. J. Algorithms 24 (1997) 20-36
14. Saunders S., and Takaoka T. Improved shortest path algorithms for nearly acyclic graphs. Electron. Notes Theor. Comput. Sci. 42 (2001) 1-17
15. Xu M.H., Lam W.H.K., Shao H., and Luan G.F. A heuristic algorithm for network equilibration. Appl. Math. Comput. 174 (2006) 430-446