On RAM Priority Queues
From MaRDI portal
Publication:4507340
DOI10.1137/S0097539795288246zbMath0968.68037WikidataQ56082331 ScholiaQ56082331MaRDI QIDQ4507340
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items
Dynamic layers of maxima with applications to dominating queries, New method in information processing for maintaining an efficient dynamic ordered set, A novel pseudo‐polynomial approach for shortest path problems, Improved bounds for finger search on a RAM, A double scaling algorithm for the constrained maximum flow problem, A faster polynomial algorithm for the constrained maximum flow problem, Integer priority queues with decrease key in constant time and the single source shortest paths problem, Dynamic interpolation search revisited, Weighted fusion graphs: Merging properties and watersheds, Cascade heap: towards time-optimal extractions, Cascade heap: towards time-optimal extractions, New presentations of a link and virtual link, A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS, A Survey on Priority Queues
