Skip to search formSkip to main contentSkip to account menu

Monotone priority queue

Known as: Radix heap 
In computer science, a monotone priority queue is a variant of the priority queue abstract data type in which the priorities of extracted items are… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Abstract data typeBest-first searchBranch and boundBucket (computing)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
1999
1999
Computational evaluation of hot queues
The heap-on-top (hot) priority queue data structure 6] improves on the best known times for Dijkstra's shortest path algorithm… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)