Fast DecreaseKey Heaps with worst case variants

10/04/2020

∙

by   Vladan Majerech, et al.

∙

0

∙

share

In the paper "Fast Fibonacci heaps with worst case extensions" we have described heaps with both Meld, DecreaseKey and DecreaseKey interfaces, allowing operations with guaranted worst case assymptotically optimal times. The paper was intended to concentrate on DecreaseKey interface, but it could be hard to separate the two described data structures without carefull reading. Current paper's goal is not to invent a novel data structure, but to describe the rather easy DecreaseKey version in hopefully readable form. The paper is intended not to require references to other papers.