About: 2–3 heap

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computer science, a 2–3 heap is a data structure, a variation on the heap, designed by in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2–3 tree. Time costs for some common heap operations are: * Delete-min takes amortized time. * Decrease-key takes constant amortized time. * Insertion takes constant amortized time.

Property Value
dbo:abstract
  • In computer science, a 2–3 heap is a data structure, a variation on the heap, designed by in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2–3 tree. Time costs for some common heap operations are: * Delete-min takes amortized time. * Decrease-key takes constant amortized time. * Insertion takes constant amortized time. (en)
dbo:wikiPageID
  • 675651 (xsd:integer)
dbo:wikiPageLength
  • 5019 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1076478412 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In computer science, a 2–3 heap is a data structure, a variation on the heap, designed by in 1999. The structure is similar to the Fibonacci heap, and borrows from the 2–3 tree. Time costs for some common heap operations are: * Delete-min takes amortized time. * Decrease-key takes constant amortized time. * Insertion takes constant amortized time. (en)
rdfs:label
  • 2–3 heap (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License