scientific article; zbMATH DE number 6469130

MaRDI QIDQ5501240zbMATH OpenFDO

Authors Ran Mendelson, Mikkel Thorup, Uri Zwick

Publication date 3 August 2015

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast meldable priority queues
• scientific article; zbMATH DE number 871900
• On RAM Priority Queues
• Algorithm Theory - SWAT 2004
• Melding priority queues
• Range-restricted mergeable priority queues
• Mergeable double-ended priority queues
• External memory priority queues with decrease-key and applications to graph algorithms
• scientific article; zbMATH DE number 1003250

Cited in

(5)

• Soft heaps simplified
• Priority queues: small, monotone and trans-dichotomous
• A simpler implementation and analysis of Chazelle's soft heaps
• Fast meldable priority queues
• Algorithm Theory - SWAT 2004

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501240)