论文标题
快速减小keater堆，最差的变体
Fast DecreaseKey Heaps with worst-case variants
论文作者
论文摘要
在论文“快速斐波那契堆具有最坏情况扩展的堆”中，我们描述了带有meld-decreasekey和减少键接口的堆，从而可以保证具有渐近最佳的最佳最佳时间的操作。该论文旨在集中于减少界面的界面，但是在不仔细阅读的情况下，很难将两个描述的数据结构分开。当前的论文的目标不是发明新颖的数据结构，而是以希望可读的形式描述一个相当容易的减少键版。该论文旨在不需要参考其他论文。
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.
