PRACTICAL EFFICIENCY OF THE LINEAR-TIME ALGORITHM FOR THE SINGLE SOURCE SHORTEST PATH PROBLEM
- 1 January 2000
- journal article
- Published by The Operations Research Society of Japan in Journal of the Operations Research Society of Japan
- Vol. 43 (4), 431-447
- https://doi.org/10.15807/jorsj.43.431
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Sorting in linear time?Published by Association for Computing Machinery (ACM) ,1995
- Trans-dichotomous algorithms for minimum spanning trees and shortest pathsJournal of Computer and System Sciences, 1994
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- PRACTICAL EFFICIENCIES OF EXISTING SHORTEST-PATH ALGORITHMS AND A NEW BUCKET ALGORITHMJournal of the Operations Research Society of Japan, 1984
- AlgorithmsCommunications of the ACM, 1964
- A note on two problems in connexion with graphsNumerische Mathematik, 1959