Quake Heaps: A Simple Alternative to Fibonacci Heaps

  • Timothy M. Chan
  • Published 2013 in
    Space-Efficient Data Structures, Streams, and…

Abstract

This note describes a data structure that has the same theoretical performance as Fibonacci heaps, supporting decrease-key operations in O(1) amortized time and delete-min operations in O(log n) amortized time. The data structure is simple to explain and analyze, and may be of pedagogical value.

DOI: 10.1007/978-3-642-40273-9_3

2 Figures and Tables

Cite this paper

@inproceedings{Chan2013QuakeHA, title={Quake Heaps: A Simple Alternative to Fibonacci Heaps}, author={Timothy M. Chan}, booktitle={Space-Efficient Data Structures, Streams, and Algorithms}, year={2013} }