Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem

DOI10.1007/978-3-642-02026-1_17MaRDI QIDQ3637065zbMATH OpenOpenAlexFDO

Authors Kamesh Madduri, K. Subramani

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_17

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Programming involving graphs or networks (90C35)

Recommendations

• Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
• Faster algorithms for the shortest path problem
• Buckets, Heaps, Lists, and Monotone Priority Queues
• On RAM Priority Queues
• A priority queue for the all pairs shortest path problem

Cited in

(3)

• Variable-priority queue and doughnut routing
• scientific article; zbMATH DE number 1086916 (Why is no real title available?)
• Two-level heaps: a new priority queue structure with applications to the single source shortest path problem

This page was built for publication: Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem

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