Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Fibonacci_heap> ?p ?o. }
Showing items 1 to 41 of
41
with 100 items per page.
- Fibonacci_heap abstract "In computer science, a Fibonacci heap is a heap data structure consisting of a collection of trees. It has a better amortized running time than a binomial heap. Fibonacci heaps were developed by Michael L. Fredman and Robert E. Tarjan in 1984 and first published in a scientific journal in 1987. The name of Fibonacci heap comes from Fibonacci numbers which are used in the running time analysis.Find-minimum is O(1) amortized time. Operations insert, decrease key, and merge (union) work in constant amortized time. Operations delete and delete minimum work in O(log n) amortized time. This means that starting from an empty data structure, any sequence of a operations from the first group and b operations from the second group would take O(a + b log n) time. In a binomial heap such a sequence of operations would take O((a + b) log (n)) time. A Fibonacci heap is thus better than a binomial heap when b is asymptotically smaller than a.Using Fibonacci heaps for priority queues improves the asymptotic running time of important algorithms, such as Dijkstra's algorithm for computing the shortest path between two nodes in a graph.".
- Fibonacci_heap thumbnail Fibonacci_heap.png?width=300.
- Fibonacci_heap wikiPageExternalLink f_heap.
- Fibonacci_heap wikiPageExternalLink 194609.
- Fibonacci_heap wikiPageExternalLink Licence_CeCILL-B_V1-en.html.
- Fibonacci_heap wikiPageExternalLink FibonacciHeapAlgorithm.html.
- Fibonacci_heap wikiPageExternalLink FibonacciHeapAnimation.html.
- Fibonacci_heap wikiPageExternalLink fibonacci.
- Fibonacci_heap wikiPageExternalLink 30072-fibonacci-heap.
- Fibonacci_heap wikiPageID "254142".
- Fibonacci_heap wikiPageRevisionID "602318415".
- Fibonacci_heap hasPhotoCollection Fibonacci_heap.
- Fibonacci_heap subject Category:Fibonacci_numbers.
- Fibonacci_heap subject Category:Heaps_(data_structures).
- Fibonacci_heap type Abstraction100002137.
- Fibonacci_heap type Amount105107765.
- Fibonacci_heap type Attribute100024264.
- Fibonacci_heap type FibonacciNumbers.
- Fibonacci_heap type Magnitude105090441.
- Fibonacci_heap type Number105121418.
- Fibonacci_heap type Property104916342.
- Fibonacci_heap comment "In computer science, a Fibonacci heap is a heap data structure consisting of a collection of trees. It has a better amortized running time than a binomial heap. Fibonacci heaps were developed by Michael L. Fredman and Robert E. Tarjan in 1984 and first published in a scientific journal in 1987. The name of Fibonacci heap comes from Fibonacci numbers which are used in the running time analysis.Find-minimum is O(1) amortized time.".
- Fibonacci_heap label "Fibonacci heap".
- Fibonacci_heap label "Fibonacci-Heap".
- Fibonacci_heap label "Montículo de Fibonacci".
- Fibonacci_heap label "Tas de Fibonacci".
- Fibonacci_heap label "Фибоначчиева куча".
- Fibonacci_heap label "フィボナッチヒープ".
- Fibonacci_heap label "斐波那契堆".
- Fibonacci_heap sameAs Fibonacciho_halda.
- Fibonacci_heap sameAs Fibonacci-Heap.
- Fibonacci_heap sameAs Montículo_de_Fibonacci.
- Fibonacci_heap sameAs Tas_de_Fibonacci.
- Fibonacci_heap sameAs フィボナッチヒープ.
- Fibonacci_heap sameAs m.01lprd.
- Fibonacci_heap sameAs Q1410737.
- Fibonacci_heap sameAs Q1410737.
- Fibonacci_heap sameAs Fibonacci_heap.
- Fibonacci_heap wasDerivedFrom Fibonacci_heap?oldid=602318415.
- Fibonacci_heap depiction Fibonacci_heap.png.
- Fibonacci_heap isPrimaryTopicOf Fibonacci_heap.
