A priority queue in which initialization and queue operations takeO(loglogD) time (Q3673101): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implementation and Analysis of Binomial Queue Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Priority queues with update and finding minimum spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of an algorithm for priority queue administration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Design and implementation of an efficient priority queue / rank | |||
Normal rank | |||
Revision as of 09:34, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A priority queue in which initialization and queue operations takeO(loglogD) time |
scientific article |
Statements
A priority queue in which initialization and queue operations takeO(loglogD) time (English)
0 references
1982
0 references
time complexity
0 references
data structure
0 references
priority queue
0 references
binary tree
0 references
