An O(tmlogD) Algorithm for shortest paths
Author:
- Pierre HansenPHPierre Hansen
- 31 July 1980
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 2 (2) , 151-153
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- Efficient Algorithms for Shortest Paths in Sparse NetworksJournal of the ACM, 1977
- A Shortest Path Algorithm for Edge-Sparse GraphsJournal of the ACM, 1976
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- A note on two problems in connexion with graphsNumerische Mathematik, 1959