An optimal algorithm for deleting the root of a heap (Q750135)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal algorithm for deleting the root of a heap |
scientific article; zbMATH DE number 4174318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for deleting the root of a heap |
scientific article; zbMATH DE number 4174318 |
Statements
An optimal algorithm for deleting the root of a heap (English)
0 references
1991
0 references
priority queue
0 references
upper bound
0 references
lower bound
0 references
Heaps
0 references
0.7833760380744934
0 references
0.7812008261680603
0 references
0.7471857666969299
0 references
0.7455291748046875
0 references
0.7387552857398987
0 references
