Affiliation:
1. Department of Computer Engineering and Systems, Alexandria University, Alexandria, Egypt
Abstract
A new priority queue is introduced, for which the cost to insert a new item is constant and the cost to delete the item x with the minimum value is O( log kx), where kx, is the number of items that are inserted after x and are still in the heap when x is deleted. We achieve the above bounds in both the amortized case and the worst case.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献