An O(mlog logD) algorithm for shortest paths
Authors:
- Rolf G. KarlssonRKRolf G. Karlsson
- Patricio V. PobletePPPatricio V. Poblete
- 31 May 1983
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 6 (1) , 91-93
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- An O(tmlogD) Algorithm for shortest pathsDiscrete Applied Mathematics, 1980
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- A note on two problems in connexion with graphsNumerische Mathematik, 1959