Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Fibonacci_heap> ?p ?o }
Showing triples 1 to 71 of
71
with 100 triples 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 wikiPageLength "17044".
- Fibonacci_heap wikiPageOutDegree "29".
- Fibonacci_heap wikiPageRevisionID "683474693".
- Fibonacci_heap wikiPageWikiLink Amortized_analysis.
- Fibonacci_heap wikiPageWikiLink Asymptotic_analysis.
- Fibonacci_heap wikiPageWikiLink Big_O_notation.
- 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 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 Minimum-heap_property.
- 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.
- Fibonacci_heap wikiPageWikiLink Shortest_path_problem.
- Fibonacci_heap wikiPageWikiLink Tree_(data_structure).
- 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 hasPhotoCollection 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 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 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 Q1410737.
- Fibonacci_heap sameAs 斐波那契堆.
- Fibonacci_heap wasDerivedFrom Fibonacci_heap?oldid=683474693.
- Fibonacci_heap depiction Fibonacci_heap.png.
- Fibonacci_heap isPrimaryTopicOf Fibonacci_heap.
