|
Related articles:
Priority queue
Heap (data structure)
Fibonacci number
Key terms: we root tree node ge log key degree size minimum cut operations marked amortized fibonacci heap delete parent sum potential linked decrease d f running time phase constant varphi bounds algorithms graph merge pointer new trees induction stored extract minimum unmarked binomial tree rooted implemented same degree amortized time delete minimum minimum key amortized running time decrease key unit of time number of children number of trees therefore the potential fibonacci heap from figure Search external links cited by footnotes on Wikipedia page Fibonacci heap: |
|