改进的配对堆上界
Improved Upper Bounds for Pairing Heaps
摘要:
配对堆被证明有固定的摊销时间插入和合并,从而表明配对堆有相同的摊销运行时间的斐波那契堆的所有操作,但减少键。
英文摘要:
Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing heaps have the same amortized runtimes as Fibonacci heaps for all operations but Decrease-key.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。