The bounds of min-max pair heap construction (Q1609155): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Min-max heaps and generalized priority queues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The relaxed min-max heap: A mergeable double-ended priority queue / rank | |||
Normal rank | |||
Revision as of 14:51, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bounds of min-max pair heap construction |
scientific article |
Statements
The bounds of min-max pair heap construction (English)
0 references
15 August 2002
0 references
algorithm
0 references
double ended priority queue
0 references
