作者mqazz1 (无法显示)
站内Prob_Solve
标题[问题] Fibonacci Heap相关证明
时间Sun Oct 3 21:17:08 2010
Let a be an F-heap with n elements that results from a sequence of insert,
meld, delete min, and decrease key operations performed on initially empty
F-heap.
Let b be any node in any of the min-trees of a
the degree of b is at most log(φ)(m) // 以φ为底
where φ = ( 1 + √5 ) / 2
m is the number of elements in the subtree with root b.
请问要怎麽证明the degree of b is at most log(φ)(m)呢?
谢谢
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 218.166.113.243