This HTML5 document contains 36 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-srhttp://sr.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Randomized_meldable_heap
rdf:type
yago:DataStructure105728493 yago:Structure105726345 yago:PsychologicalFeature100023100 yago:Abstraction100002137 yago:Cognition100023271 dbo:Software yago:Arrangement105726596 yago:WikicatDataStructures
rdfs:label
Randomized meldable heap
rdfs: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.
dcterms:subject
dbc:Priority_queues
dbo:wikiPageID
39033432
dbo:wikiPageRevisionID
994351033
dbo:wikiPageWikiLink
dbr:Heap_(data_structure) dbr:Binomial_heap dbr:Pairing_heap dbr:Leftist_heap dbc:Priority_queues dbr:Binary_tree dbr:Priority_Queue dbr:Data_structure dbr:Fibonacci_Heap dbr:Skew_heap
owl:sameAs
dbpedia-sr:Slučajan_promešan_hip yago-res:Randomized_meldable_heap n15:gWA3 freebase:m.0swljj6 wikidata:Q17145953
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo: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.
gold:hypernym
dbr:Queue
prov:wasDerivedFrom
wikipedia-en:Randomized_meldable_heap?oldid=994351033&ns=0
dbo:wikiPageLength
5208
foaf:isPrimaryTopicOf
wikipedia-en:Randomized_meldable_heap
Subject Item
dbr:Heap_(data_structure)
dbo:wikiPageWikiLink
dbr:Randomized_meldable_heap
Subject Item
wikipedia-en:Randomized_meldable_heap
foaf:primaryTopic
dbr:Randomized_meldable_heap