arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.5750cs.DS
收藏

再论斐波那契堆

Fibonacci Heaps Revisited

Haim Kaplan, Robert E. Tarjan, Uri Zwick

摘要:

斐波那契堆是一个经典的数据结构,它支持在对数摊销时间内执行删除操作,并支持在O(1)摊销时间内执行所有其他堆操作。我们探索这种数据结构的设计空间。我们提出了一个版本,与原来的以下改进:(i)每个堆是由一个单一的堆排序树,而不是一组树。(ii)每个减键操作只进行一次切割和一系列等级变化,而不是进行一系列切割。(iii)由算法完成的所有比较的结果都明确地表示在数据结构中,因此没有浪费。通过一个例子说明,在没有级联剪切或秩变化的情况下,原数据结构和新版本都不能达到预期的效率,解决了Fredman的一个公开问题.最后,我们说明了丰富的设计空间,提出了几种替代方法来做级联排名的变化,包括一个随机化的策略,以前提出的卡格。我们把对这些替代方案的分析作为有趣的开放问题。

英文摘要:

The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time and all other heap operations in O(1) amortized time. We explore the design space of this data structure. We propose a version with the following improvements over the original: (i) Each heap is represented by a single heap-ordered tree, instead of a set of trees. (ii) Each decrease-key operation does only one cut and a cascade of rank changes, instead of doing a cascade of cuts. (iii) The outcomes of all comparisons done by the algorithm are explicitly represented in the data structure, so none are wasted. We also give an example to show that without cascading cuts or rank changes, both the original data structure and the new version fail to have the desired efficiency, solving an open problem of Fredman. Finally, we illustrate the richness of the design space by proposing several alternative ways to do cascading rank changes, including a randomized strategy related to one previously proposed by Karger. We leave the analysis of these alternatives as intriguing open problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑