DBpedia – Linked Data Fragments

Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Fibonacci_heap> ?p ?o }

• Fibonacci_heap abstract "In computer science, a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better amortized running time than many other priority queue data structures including the binary heap and binomial heap. Michael L. Fredman and Robert E. Tarjan developed Fibonacci heaps in 1984 and published them in a scientific journal in 1987. They named Fibonacci heaps after the Fibonacci numbers, which are used in their running time analysis.For the Fibonacci heap, the find-minimum operation takes constant (O(1)) amortized time. The insert and decrease key operations also work in constant amortized time. Deleting an element (most often used in the special case of deleting the minimum element) works in O(log n) amortized time, where n is the size of the heap. This means that starting from an empty data structure, any sequence of a insert and decrease key operations and b delete operations would take O(a + b log n) worst case time, where n is the maximum heap size. In a binary or binomial heap such a sequence of operations would take O((a + b) log n) time. A Fibonacci heap is thus better than a binary or binomial heap when b is smaller than a by a non-constant factor. It is also possible to merge two Fibonacci heaps in constant amortized time, improving on the logarithmic merge time of a binomial heap, and improving on binary heaps which cannot handle merges efficiently.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, compared to the same algorithm using other slower priority queue data structures.".
• 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 wikiPageLength "18687".
• Fibonacci_heap wikiPageOutDegree "31".
• Fibonacci_heap wikiPageRevisionID "703573671".
• Fibonacci_heap wikiPageWikiLink Amortized_analysis.
• Fibonacci_heap wikiPageWikiLink Big_O_notation.
• Fibonacci_heap wikiPageWikiLink Binary_heap.
• Fibonacci_heap wikiPageWikiLink Binomial_heap.
• Fibonacci_heap wikiPageWikiLink Brodal_queue.
• Fibonacci_heap wikiPageWikiLink Category:Fibonacci_numbers.
• Fibonacci_heap wikiPageWikiLink Category:Heaps_(data_structures).
• Fibonacci_heap wikiPageWikiLink Computer_science.
• Fibonacci_heap wikiPageWikiLink Data_structure.
• Fibonacci_heap wikiPageWikiLink Dijkstras_algorithm.
• Fibonacci_heap wikiPageWikiLink Doubly_linked_list.
• Fibonacci_heap wikiPageWikiLink Fibonacci_number.
• Fibonacci_heap wikiPageWikiLink Heap_(data_structure).
• Fibonacci_heap wikiPageWikiLink Michael_Fredman.
• Fibonacci_heap wikiPageWikiLink Pairing_heap.
• Fibonacci_heap wikiPageWikiLink Potential_method.
• Fibonacci_heap wikiPageWikiLink Priority_queue.
• Fibonacci_heap wikiPageWikiLink Real-time_computing.
• Fibonacci_heap wikiPageWikiLink Robert_Tarjan.
• Fibonacci_heap wikiPageWikiLink Shortest_path_problem.
• Fibonacci_heap wikiPageWikiLink Tree_(data_structure).
• Fibonacci_heap wikiPageWikiLink File:Fibonacci_heap-decreasekey.png.
• Fibonacci_heap wikiPageWikiLink File:Fibonacci_heap.png.
• Fibonacci_heap wikiPageWikiLink File:Fibonacci_heap_extractmin1.png.
• Fibonacci_heap wikiPageWikiLink File:Fibonacci_heap_extractmin2.png.
• Fibonacci_heap wikiPageWikiLinkText "Fibonacci heap".
• Fibonacci_heap wikiPageWikiLinkText "Fibonacci_heap".
• Fibonacci_heap wikiPageUsesTemplate Template:Data_structures.
• Fibonacci_heap wikiPageUsesTemplate Template:Expand_section.
• Fibonacci_heap wikiPageUsesTemplate Template:Heap_Running_Times.
• Fibonacci_heap wikiPageUsesTemplate Template:Reflist.
• Fibonacci_heap subject Category:Fibonacci_numbers.
• Fibonacci_heap subject Category:Heaps_(data_structures).
• Fibonacci_heap hypernym Structure.
• Fibonacci_heap type Building.
• Fibonacci_heap type Redirect.
• Fibonacci_heap comment "In computer science, a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better amortized running time than many other priority queue data structures including the binary heap and binomial heap. Michael L. Fredman and Robert E. Tarjan developed Fibonacci heaps in 1984 and published them in a scientific journal in 1987.".
• Fibonacci_heap label "Fibonacci heap".
• Fibonacci_heap sameAs Q1410737.
• Fibonacci_heap sameAs Fibonacciho_halda.
• Fibonacci_heap sameAs Fibonacci-Heap.
• Fibonacci_heap sameAs Montículo_de_Fibonacci.
• Fibonacci_heap sameAs هیپ_فیبوناتچی.
• Fibonacci_heap sameAs Tas_de_Fibonacci.
• Fibonacci_heap sameAs xd7xa2xd7xa8xd7x99xd7x9exd7xaa_xd7xa4xd7x99xd7x91xd7x95xd7xa0xd7x90xd7xa6xd7x99.
• Fibonacci_heap sameAs フィボナッチヒープ.
• Fibonacci_heap sameAs m.01lprd.
• Fibonacci_heap sameAs Фибоначчиева_куча.
• Fibonacci_heap sameAs Fibonači_hip.
• Fibonacci_heap sameAs Fibonacci_heap.
• Fibonacci_heap sameAs ฮีปฟีโบนัชชี.
• Fibonacci_heap sameAs Фібоначчієва_купа.
• Fibonacci_heap sameAs Q1410737.
• Fibonacci_heap sameAs 斐波那契堆.
• Fibonacci_heap wasDerivedFrom Fibonacci_heap?oldid=703573671.
• Fibonacci_heap depiction Fibonacci_heap.png.
• Fibonacci_heap isPrimaryTopicOf Fibonacci_heap.