Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Randomized_meldable_heap> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- Randomized_meldable_heap abstract "In computer science, a randomized meldable heap (also Meldable Heap or Randomized Meldable Priority Queue) is a priority queue based data structure in which the underlying structure is also a heap-ordered binary tree. However, there are no restrictions on the shape of the underlying binary tree.This approach has a number of advantages over similar data structures. It offers greater simplicity: all operations for the randomized meldable heap are easy to implement and the constant factors in their complexity bounds are small. There is also no need to preserve balance conditions and no satellite information within the nodes is necessary. Lastly, this structure has good worst-case time efficiency. The execution time of each individual operation is at most logarithmic with high probability.".
- Randomized_meldable_heap wikiPageID "39033432".
- Randomized_meldable_heap wikiPageLength "5149".
- Randomized_meldable_heap wikiPageOutDegree "10".
- Randomized_meldable_heap wikiPageRevisionID "575168493".
- Randomized_meldable_heap wikiPageWikiLink Binary_tree.
- Randomized_meldable_heap wikiPageWikiLink Binomial_heap.
- Randomized_meldable_heap wikiPageWikiLink Category:Data_structures.
- Randomized_meldable_heap wikiPageWikiLink Data_structure.
- Randomized_meldable_heap wikiPageWikiLink Fibonacci_Heap.
- Randomized_meldable_heap wikiPageWikiLink Fibonacci_heap.
- Randomized_meldable_heap wikiPageWikiLink Heap_(data_structure).
- Randomized_meldable_heap wikiPageWikiLink Leftist_heap.
- Randomized_meldable_heap wikiPageWikiLink Leftist_tree.
- Randomized_meldable_heap wikiPageWikiLink Pairing_heap.
- Randomized_meldable_heap wikiPageWikiLink Priority_Queue.
- Randomized_meldable_heap wikiPageWikiLink Priority_queue.
- Randomized_meldable_heap wikiPageWikiLink Skew_heap.
- Randomized_meldable_heap wikiPageWikiLinkText "Randomized meldable heap".
- Randomized_meldable_heap hasPhotoCollection Randomized_meldable_heap.
- Randomized_meldable_heap wikiPageUsesTemplate Template:Reflist.
- Randomized_meldable_heap subject Category:Data_structures.
- Randomized_meldable_heap hypernym Queue.
- Randomized_meldable_heap type Software.
- Randomized_meldable_heap type Datum.
- Randomized_meldable_heap type Structure.
- Randomized_meldable_heap comment "In computer science, a randomized meldable heap (also Meldable Heap or Randomized Meldable Priority Queue) is a priority queue based data structure in which the underlying structure is also a heap-ordered binary tree. However, there are no restrictions on the shape of the underlying binary tree.This approach has a number of advantages over similar data structures.".
- Randomized_meldable_heap label "Randomized meldable heap".
- Randomized_meldable_heap sameAs m.0swljj6.
- Randomized_meldable_heap sameAs Slučajan_promešan_hip.
- Randomized_meldable_heap sameAs Q17145953.
- Randomized_meldable_heap sameAs Q17145953.
- Randomized_meldable_heap wasDerivedFrom Randomized_meldable_heap?oldid=575168493.
- Randomized_meldable_heap isPrimaryTopicOf Randomized_meldable_heap.