Name
Abstract | ||
|---|---|---|
This paper presents a symmetrical implicit double-ended priority queue implementation, which can be built in linear time. The smallest and the largest element can be found in constant time, and deleted in logarithmic time. This structure is an improvement of the MinMaxHeap presented by Atkinson et al. (1986). |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1016/0020-0190(87)90033-0 | Inf. Process. Lett. |
Keywords | Field | DocType |
double-ended heap,double-ended priority queue,priority queue,heap,double ended priority queue | Discrete mathematics,Fibonacci heap,Min-max heap,Heap (data structure),Priority queue,Binary heap,Binomial heap,Mathematics,d-ary heap,Double-ended priority queue | Journal |
Volume | Issue | ISSN |
26 | 1 | 0020-0190 |
Citations | PageRank | References |
34 | 1.97 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Svante Carlsson | 1 | 764 | 90.17 |