A Faster External Memory Priority Queue with DecreaseKeys
Published in arXiv (Cornell University) • Jun 20, 2018
Authors:,
Shunhua Jiang
Kasper Green Larsen
Abstract
A priority queue is a fundamental data structure that maintains a dynamic set of (key, priority)-pairs and supports Insert, Delete, ExtractMin and DecreaseKey operations. In the external memory model, the current best priority queue supports each operation in amortized $O(\frac{1}{B}\log \frac{N}{B}...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!