ISSN:
1432-0541
Keywords:
Heaps
;
Priority queues
;
Data structures
;
Applications
;
Sorting
;
Graphs
;
Performance
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Results indicate that the two recently introduced self-adjusting heaps are the most competitive choices for the applications considered. Further, the results indicate that only some heap structures support lazymerge/lazydelete operations well, partially confirming that algorithms based on top-down skew heap compare more favorably than those based on binomial queues, that there are strong grounds for believing the conjectured amortized time bounds for pairing heap operations, and that pairing heaps are a competitive alternative to Fibonacci heaps.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01758771
Permalink