Abstract: I have produced a C++ implementation of relaxed weak queues. This newly invented data structure is a simplification of — and supports all priority- queue operations as efficiently as — a run-relaxed heap, namely: get-highest- priority, insert and increase-priority in O(1) worst-case time, and delete in O(lgn) worst-case time, n denoting the number of elements stored prior to the operation. Further, the data structure supports meld in O(min{lgm,lgn}) worst-case time, where m and n denote the sizes of the sub-collections melded.
Publication Year: 2008
Publication Date: 2008-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot