Fibonacci heap

Fibonacci heap

Jesse Russell Ronald Cohn

     

бумажная книга



ISBN: 978-5-5080-4600-2

High Quality Content by WIKIPEDIA articles! 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.