Affordable Access

Publisher Website

Theory of 2–3 Heaps

Authors
Journal
Discrete Applied Mathematics
0166-218X
Publisher
Elsevier
Publication Date
Volume
126
Issue
1
Identifiers
DOI: 10.1016/s0166-218x(02)00219-6
Disciplines
  • Computer Science
  • Design

Abstract

Abstract As an alternative to the Fibonacci heap, we design a new data structure called a 2–3 heap, which supports n insert, n delete-min, and m decrease-key operations in O(m+n log n) time. Our experiments show the 2–3 heap is more efficient. The new data structure will have a wide application in graph algorithms.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments