Fibonacci heaps and their uses in improved network optimization algorithms
本文档由 Terry Chow 分享于2012-03-02 12:35
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. F-heaps support arbitrary deletion from an n-item heap in O(log n) amortized time and all other standard heap operations in O..
下载文档
收藏
打印
分享:
君,已阅读到文档的结尾了呢~~