Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Monotone_priority_queue> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Monotone_priority_queue abstract "In computer science, a monotone priority queue is a variant of the priority queue/heap data structure. It offers insert and extract-min operations (or extract-max; this article assumes min-priority queues, without loss of generality), like an ordinary priority queue, but imposes the restriction that a key (item) may only be inserted if its priority is greater than that of the last key extracted from the queue. This entails that the sequence of keys extracted from the queue form a monotonically increasing sequence. This restriction is met by several applications, including discrete event simulation and the best-first version of branch and bound.Specialized monotone PQ data structures can be used to obtain asymptotically better running times for algorithms using them, compared to standard priority queues. For example, in graphs with integer edge costs, these structures can be used to speed up Dijkstra's algorithm for shortest-path finding (for arbitrary edge costs, it is unknown whether a speedup can be achieved).".
- Monotone_priority_queue wikiPageExternalLink 3deec522ec2bd5ad21.pdf.
- Monotone_priority_queue wikiPageID "43920111".
- Monotone_priority_queue wikiPageLength "2214".
- Monotone_priority_queue wikiPageOutDegree "11".
- Monotone_priority_queue wikiPageRevisionID "644104725".
- Monotone_priority_queue wikiPageWikiLink Analysis_of_algorithms.
- Monotone_priority_queue wikiPageWikiLink Best-first_search.
- Monotone_priority_queue wikiPageWikiLink Branch_and_bound.
- Monotone_priority_queue wikiPageWikiLink Category:Priority_queues.
- Monotone_priority_queue wikiPageWikiLink Computer_science.
- Monotone_priority_queue wikiPageWikiLink Dijkstras_algorithm.
- Monotone_priority_queue wikiPageWikiLink Discrete_event_simulation.
- Monotone_priority_queue wikiPageWikiLink Heap_(data_structure).
- Monotone_priority_queue wikiPageWikiLink Monotonic_function.
- Monotone_priority_queue wikiPageWikiLink Priority_queue.
- Monotone_priority_queue wikiPageWikiLink Without_loss_of_generality.
- Monotone_priority_queue wikiPageWikiLinkText "Monotone priority queue".
- Monotone_priority_queue wikiPageWikiLinkText "monotone priority queue".
- Monotone_priority_queue hasPhotoCollection Monotone_priority_queue.
- Monotone_priority_queue wikiPageUsesTemplate Template:Cite_conference.
- Monotone_priority_queue wikiPageUsesTemplate Template:Reflist.
- Monotone_priority_queue wikiPageUsesTemplate Template:Rp.
- Monotone_priority_queue subject Category:Priority_queues.
- Monotone_priority_queue hypernym Variant.
- Monotone_priority_queue comment "In computer science, a monotone priority queue is a variant of the priority queue/heap data structure. It offers insert and extract-min operations (or extract-max; this article assumes min-priority queues, without loss of generality), like an ordinary priority queue, but imposes the restriction that a key (item) may only be inserted if its priority is greater than that of the last key extracted from the queue.".
- Monotone_priority_queue label "Monotone priority queue".
- Monotone_priority_queue sameAs m.011x431j.
- Monotone_priority_queue sameAs Q18391020.
- Monotone_priority_queue sameAs Q18391020.
- Monotone_priority_queue wasDerivedFrom Monotone_priority_queue?oldid=644104725.
- Monotone_priority_queue isPrimaryTopicOf Monotone_priority_queue.