Year: 2020
Type: preprint
Abstract: In the paper "Fast Fibonacci heaps with worst case extensions", we have described heaps with both Meld-DecreaseKey and DecreaseKey interfaces, allowing operations with guaranteed worst-case asymptotically optimal times. The paper was intended to concentrate on the DecreaseKey interface, but it could be hard to separate the two described data structures without careful reading. The current paper's goal is not to invent a novel data structure, but to describe a rather easy DecreaseKey version in a hopefully readable form. The paper is intended not to require reference to other papers.
Source: arXiv (Cornell University)
Author: Majerech, Vladan
Institution: Charles University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W3092555562