Affiliation:
1. Max-Planck Institut für Informatik, Saarbrücken, Germany
Abstract
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires O( log n) amortized time. Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps. The main idea behind our construction is to propagate rank updates instead of performing cascaded cuts following a decrease-key operation, allowing for a relaxed structure.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Smooth Heaps and a Dual View of Self-Adjusting Data Structures;SIAM Journal on Computing;2019-11-05
2. Smooth heaps and a dual view of self-adjusting data structures;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
3. Hollow Heaps;ACM Transactions on Algorithms;2017-07-31
4. Replacing Mark Bits with Randomness in Fibonacci Heaps;Automata, Languages, and Programming;2015
5. Hollow Heaps;Automata, Languages, and Programming;2015