Skip to search formSkip to main contentSkip to account menu

Brodal queue

Known as: Brodel queue 
In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: for insertion, find-minimum, meld… 
Wikipedia (opens in a new tab)

Search for papers about Brodal queue

Search papers