Matches in DBpedia 2014 for { <http://dbpedia.org/resource/AF-heap> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- AF-heap abstract "In computer science, the AF-heap is a type of priority queue for integer data, an extension of the fusion tree using an atomic heap proposed by M. L. Fredman and D. E. Willard.Using an AF-heap, it is possible to perform m insert or decrease-key operations and n delete-min operations on machine-integer keys in time O(m + n log n / log log n). This allows Dijkstra's algorithm to be performed in the same O(m + n log n / log log n) time bound on graphs with n edges and m vertices, and leads to a linear time algorithm for minimum spanning trees, with the assumption for both problems that the edge weights of the input graph are machine integers in the transdichotomous model.".
- AF-heap wikiPageID "1857196".
- AF-heap wikiPageRevisionID "534992430".
- AF-heap hasPhotoCollection AF-heap.
- AF-heap subject Category:Heaps_(data_structures).
- AF-heap subject Category:Priority_queues.
- AF-heap type Abstraction100002137.
- AF-heap type Arrangement107938773.
- AF-heap type Formation108426461.
- AF-heap type Group100031264.
- AF-heap type Line108430203.
- AF-heap type PriorityQueues.
- AF-heap type Queue108432345.
- AF-heap comment "In computer science, the AF-heap is a type of priority queue for integer data, an extension of the fusion tree using an atomic heap proposed by M. L. Fredman and D. E. Willard.Using an AF-heap, it is possible to perform m insert or decrease-key operations and n delete-min operations on machine-integer keys in time O(m + n log n / log log n).".
- AF-heap label "AF-heap".
- AF-heap sameAs m.061h78.
- AF-heap sameAs Q4651388.
- AF-heap sameAs Q4651388.
- AF-heap sameAs AF-heap.
- AF-heap wasDerivedFrom AF-heap?oldid=534992430.
- AF-heap isPrimaryTopicOf AF-heap.