In computer science, a 2-3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2-3 tree. Time costs for some common heap operations: delete-min takes amortized time decrease-key takes constant amortized time insertion takes constant amortized time.
| Property | Value |
|---|
| dbpedia-owl:abstract
|
- In computer science, a 2-3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2-3 tree. Time costs for some common heap operations: delete-min takes amortized time decrease-key takes constant amortized time insertion takes constant amortized time.
|
| dbpedia-owl:wikiPageExternalLink
| |
| dcterms:subject
| |
| rdfs:comment
|
- In computer science, a 2-3 heap is a data structure, a variation on the heap, designed by Tadao Takaoka in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2-3 tree. Time costs for some common heap operations: delete-min takes amortized time decrease-key takes constant amortized time insertion takes constant amortized time.
|
| rdfs:label
| |
| owl:sameAs
| |
| foaf:page
| |
| is owl:sameAs
of | |
| is foaf:primaryTopic
of | |
