Relaxed heaps

Journal Article · Mon Oct 31 23:00:00 EST 1988 · Commun. ACM; (United States)

DOI:https://doi.org/10.1145/50087.50096· OSTI ID:6526005

Driscoll, J R ^[1]; Gabow, H N; Shrairman, R ^[2]; Tarjan, R E ^[3]

---

1. Dept. of Mathematics and Computer Science, Dartmouth College, Hanover, NH (US)
2. Dept. of Computer Science, Univ. of Colorado, Boulder, CO (US)
3. Computer Science Dept., Princeton Univ., Princeton, NJ (US)

The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap - a sequence of m decrease key and n delete min operations takes time O(m + n log n). A variant of relaxed heaps achieves similar bounds in the worst case - O(1) time for decrease key and O(log n) for delete min. Relaxed heaps give a processor-efficient parallel implementation of Dijkstra's shortest path algorithm, and hence other algorithms in network optimization. A relaxed heap is a type of binomial queue that allows heap order to be violated.

• OSTI ID: 6526005
• Journal Information: Commun. ACM; (United States), Journal Name: Commun. ACM; (United States) Vol. 31:11; ISSN CACMA
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTER NETWORKS
DATA PROCESSING
MATHEMATICAL LOGIC
OPTIMIZATION
PARALLEL PROCESSING
PROCESSING
PROGRAMMING
QUEUES