Fibonacci heaps and their uses in improved network optimization algorithms

@article{Fredman1987FibonacciHA,
  title={Fibonacci heaps and their uses in improved network optimization algorithms},
  author={M. Fredman and R. Tarjan},
  journal={J. ACM},
  year={1987},
  volume={34},
  pages={596-615}
}
  • M. Fredman, R. Tarjan
  • Published 1987
  • Mathematics, Computer Science
  • J. ACM
  • In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heaps</italic> (abbreviated <italic>F-heaps</italic>), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an <italic>n</italic>-item heap in <italic>O</italic>(log <italic>n</italic>) amortized time and all other standard heap operations in <italic>O</italic>(1) amortized time. Using F-heaps we are able to… CONTINUE READING
    1,041 Citations
    Cache-oblivious shortest paths in graphs using buffer heap
    • 24
    • PDF
    Almost-optimum speed-ups of algorithms for bipartite matching and related problems
    • 56
    • PDF
    Cache-oblivious Buffer Heap and Its Applications
      • PDF
      Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs
      • 3
      Integer priority queues with decrease key in constant time and the single source shortest paths problem
      • M. Thorup
      • Mathematics, Computer Science
      • J. Comput. Syst. Sci.
      • 2004
      • 52
      A new approach to all pairs shortest paths in planar graphs
      • 18
      Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
      • U. Meyer
      • Computer Science, Mathematics
      • Euro-Par
      • 2001
      • 7
      Computational Efficiency of Optimized Shortest Path Algorithms
      • 6
      • PDF
      Practical Applicability of Advanced Implementations of Priority Queues in Finding Shortest Paths
      • 1

      References

      SHOWING 1-3 OF 3 REFERENCES
      A note on two problems in connexion with graphs
      • E. Dijkstra
      • Mathematics, Computer Science
      • Numerische Mathematik
      • 1959
      • 19,630
      • Highly Influential
      • PDF
      Efficient Implementation of Graph Algorithms Using Contraction
      • 50
      • Highly Influential
      Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pa
      • 1983