Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

Authors:
M. L. Fredman;R. E. Tarjan
Affiliations:
University of CA, San Diego;-
Venue:
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Year:
1984

Citing 0
Cited 9

An output sensitive algorithm for computing visibility graphs

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Detection of multi-scale clusters in network space

International Journal of Geographical Information Science
Transport logistics planning with service-level constraints

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Delay-constrained survivable multicast routing problem in WDM networks

Computer Communications
Computation of shortest path in cellular automata

Mathematical and Computer Modelling: An International Journal
Strongly polynomial time algorithms for certain concave minimization problems on networks

Operations Research Letters
Two new economic models for privacy

ACM SIGMETRICS Performance Evaluation Review
Compact representation of GPS trajectories over vectorial road networks

SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Delay-constrained survivable multicast routing problem in WDM networks with shared segment-based protection

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in 0(log n) amortized time and all other standard heap operations in 0(1) amortized time. Using F-heaps we are able to obtain improved running times for several network optimization algorithms.