Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,890,965 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Best, worst and average case
Computer science
Dijkstra's algorithm
Fibonacci heap
Expand
Search for papers about Brodal queue
Search papers