Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Kinetic_priority_queue> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples 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 wikiPageLength "6017".
- Kinetic_priority_queue wikiPageOutDegree "18".
- Kinetic_priority_queue wikiPageRevisionID "607153317".
- Kinetic_priority_queue wikiPageWikiLink Abstract_data_type.
- Kinetic_priority_queue wikiPageWikiLink Ackermann_function.
- Kinetic_priority_queue wikiPageWikiLink Broadcast_scheduling.
- Kinetic_priority_queue wikiPageWikiLink Category:Abstract_data_types.
- Kinetic_priority_queue wikiPageWikiLink Category:Articles_created_via_the_Article_Wizard.
- Kinetic_priority_queue wikiPageWikiLink Category:Kinetic_data_structures.
- Kinetic_priority_queue wikiPageWikiLink Category:Priority_queues.
- Kinetic_priority_queue wikiPageWikiLink Davenport–Schinzel_sequence.
- Kinetic_priority_queue wikiPageWikiLink Dynamic_convex_hull.
- Kinetic_priority_queue wikiPageWikiLink Kinetic_closest_pair.
- Kinetic_priority_queue wikiPageWikiLink Kinetic_clustering.
- Kinetic_priority_queue wikiPageWikiLink Kinetic_data_structure.
- Kinetic_priority_queue wikiPageWikiLink Kinetic_hanger.
- Kinetic_priority_queue wikiPageWikiLink Kinetic_heap.
- Kinetic_priority_queue wikiPageWikiLink Kinetic_heater.
- Kinetic_priority_queue wikiPageWikiLink Kinetic_max-cut.
- Kinetic_priority_queue wikiPageWikiLink Kinetic_tournament.
- Kinetic_priority_queue wikiPageWikiLink Priority_queue.
- Kinetic_priority_queue wikiPageWikiLinkText "Kinetic priority queue".
- Kinetic_priority_queue wikiPageWikiLinkText "kinetic priority queue".
- Kinetic_priority_queue wikiPageUsesTemplate Template:Math.
- Kinetic_priority_queue wikiPageUsesTemplate Template:Reflist.
- 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 hypernym Structure.
- Kinetic_priority_queue type Building.
- Kinetic_priority_queue type Type.
- Kinetic_priority_queue type Concept.
- Kinetic_priority_queue type Method.
- Kinetic_priority_queue type Redirect.
- Kinetic_priority_queue type Structure.
- Kinetic_priority_queue type Type.
- 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 Q6410795.
- Kinetic_priority_queue sameAs m.0jwsx99.
- Kinetic_priority_queue sameAs Q6410795.
- Kinetic_priority_queue wasDerivedFrom Kinetic_priority_queue?oldid=607153317.
- Kinetic_priority_queue isPrimaryTopicOf Kinetic_priority_queue.