Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/D-ary_heap> ?p ?o }
Showing triples 1 to 47 of
47
with 100 triples per page.
- D-ary_heap abstract "The d-ary heap or d-heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2. Thus, a binary heap is a 2-heap, and a ternary heap is a 3-heap. According to Tarjan and Jensen et al., d-ary heaps were invented by Donald B. Johnson in 1975.This data structure allows decrease priority operations to be performed more quickly than binary heaps, at the expense of slower delete minimum operations. This tradeoff leads to better running times for algorithms such as Dijkstra's algorithm in which decrease priority operations are more common than delete min operations. Additionally, d-ary heaps have better memory cache behavior than a binary heap, allowing them to run more quickly in practice despite having a theoretically larger worst-case running time. Like binary heaps, d-ary heaps are an in-place data structure that uses no additional storage beyond that needed to store the array of items in the heap.".
- D-ary_heap wikiPageExternalLink gheap.
- D-ary_heap wikiPageID "11960848".
- D-ary_heap wikiPageLength "11763".
- D-ary_heap wikiPageOutDegree "20".
- D-ary_heap wikiPageRevisionID "646316202".
- D-ary_heap wikiPageWikiLink Array_data_structure.
- D-ary_heap wikiPageWikiLink Binary_heap.
- D-ary_heap wikiPageWikiLink Breadth-first_search.
- D-ary_heap wikiPageWikiLink CPU_cache.
- D-ary_heap wikiPageWikiLink Cache_memory.
- D-ary_heap wikiPageWikiLink Cache_miss.
- D-ary_heap wikiPageWikiLink Category:Heaps_(data_structures).
- D-ary_heap wikiPageWikiLink Data_structure.
- D-ary_heap wikiPageWikiLink Dijkstras_algorithm.
- D-ary_heap wikiPageWikiLink Donald_B._Johnson.
- D-ary_heap wikiPageWikiLink Fibonacci_heap.
- D-ary_heap wikiPageWikiLink In-place_algorithm.
- D-ary_heap wikiPageWikiLink Memory_cache.
- D-ary_heap wikiPageWikiLink Minimum_spanning_tree.
- D-ary_heap wikiPageWikiLink Page_fault.
- D-ary_heap wikiPageWikiLink Prims_algorithm.
- D-ary_heap wikiPageWikiLink Priority_queue.
- D-ary_heap wikiPageWikiLink Shortest_path.
- D-ary_heap wikiPageWikiLink Shortest_path_problem.
- D-ary_heap wikiPageWikiLink Virtual_memory.
- D-ary_heap wikiPageWikiLinkText "''d''-ary heap".
- D-ary_heap wikiPageWikiLinkText "-ary heap".
- D-ary_heap wikiPageWikiLinkText "D-ary heap".
- D-ary_heap wikiPageWikiLinkText "d-ary heap".
- D-ary_heap hasPhotoCollection D-ary_heap.
- D-ary_heap wikiPageUsesTemplate Template:Math.
- D-ary_heap wikiPageUsesTemplate Template:Reflist.
- D-ary_heap subject Category:Heaps_(data_structures).
- D-ary_heap hypernym Structure.
- D-ary_heap type Building.
- D-ary_heap comment "The d-ary heap or d-heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2. Thus, a binary heap is a 2-heap, and a ternary heap is a 3-heap. According to Tarjan and Jensen et al., d-ary heaps were invented by Donald B. Johnson in 1975.This data structure allows decrease priority operations to be performed more quickly than binary heaps, at the expense of slower delete minimum operations.".
- D-ary_heap label "D-ary heap".
- D-ary_heap sameAs هیپ_دی_تایی.
- D-ary_heap sameAs Kopiec_a-arny.
- D-ary_heap sameAs m.02rzr5r.
- D-ary_heap sameAs D-hip.
- D-ary_heap sameAs D-арна_купа.
- D-ary_heap sameAs Q5203305.
- D-ary_heap sameAs Q5203305.
- D-ary_heap wasDerivedFrom D-ary_heap?oldid=646316202.
- D-ary_heap isPrimaryTopicOf D-ary_heap.