DMCA
Are Fibonacci Heaps Optimal? (1994)
Cached
Download Links
- [ftp.cs.su.oz.au]
- [www.it.usyd.edu.au]
- [sydney.edu.au]
- DBLP
Other Repositories/Bibliography
by
Diab Abuaiadh
,
Jeffrey H. Kingston
| Venue: | ISAAC'94, LNCS |
| Citations: | 7 - 0 self |
BibTeX
@INPROCEEDINGS{Abuaiadh94arefibonacci,
author = {Diab Abuaiadh and Jeffrey H. Kingston},
title = {Are Fibonacci Heaps Optimal?},
booktitle = {ISAAC'94, LNCS},
year = {1994},
pages = {442--450},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable assumptions, there exist sequences of n Insert, n Delete, m DecreaseKey and t FindMin operations, where 1 t n, which have W(nlogt + n + m) complexity. Although Fibonacci heaps do not achieve this bound, we present a modified Fibonacci heap which does, and so is optimal under our assumptions.
