Integer priority queues with decrease key in constant time and the single source shortest paths problem
Author:
- 1 November 2004
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 69 (3) , 330-353
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Faster deterministic sorting and searching in linear space2002
- Buckets, Heaps, Lists, and Monotone Priority QueuesSIAM Journal on Computing, 1999
- Marked Ancestor ProblemsBRICS Report Series, 1998
- Dictionaries on AC^0 RAMs: Query Time Theta(√log n/log log n) is Necessary and SufficientBRICS Report Series, 1997
- Faster algorithms for the shortest path problemJournal of the ACM, 1990
- Optimal bounds for decision problems on the CRCW PRAMJournal of the ACM, 1989
- Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computationCommunications of the ACM, 1988
- Shortest-Route Methods: 1. Reaching, Pruning, and BucketsOperations Research, 1979
- 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