Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Kinetic_priority_queue> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Kinetic_priority_queue abstract "A Kinetic Priority Queue is an abstract kinetic data structure. It is a variant of a priority queue designed to maintain the maximum (or minimum) priority element (key-value pair) when the priority of every element is changing as a continuous function of time. Kinetic priority queues have been used as components of several kinetic data structures, as well as to solve some important non-kinetic problems such as the k-set problem and the connected red blue segments intersection problem.".
- Kinetic_priority_queue wikiPageID "35846544".
- Kinetic_priority_queue wikiPageRevisionID "577781771".
- Kinetic_priority_queue hasPhotoCollection Kinetic_priority_queue.
- Kinetic_priority_queue subject Category:Abstract_data_types.
- Kinetic_priority_queue subject Category:Articles_created_via_the_Article_Wizard.
- Kinetic_priority_queue subject Category:Kinetic_data_structures.
- Kinetic_priority_queue subject Category:Priority_queues.
- Kinetic_priority_queue comment "A Kinetic Priority Queue is an abstract kinetic data structure. It is a variant of a priority queue designed to maintain the maximum (or minimum) priority element (key-value pair) when the priority of every element is changing as a continuous function of time. Kinetic priority queues have been used as components of several kinetic data structures, as well as to solve some important non-kinetic problems such as the k-set problem and the connected red blue segments intersection problem.".
- Kinetic_priority_queue label "Kinetic priority queue".
- Kinetic_priority_queue sameAs m.0jwsx99.
- Kinetic_priority_queue sameAs Q6410795.
- Kinetic_priority_queue sameAs Q6410795.
- Kinetic_priority_queue wasDerivedFrom Kinetic_priority_queue?oldid=577781771.
- Kinetic_priority_queue isPrimaryTopicOf Kinetic_priority_queue.