August 16th, 2013, 05:41 PM
[Fibonacci Heaps] Promote a node after more than 2 loss children
I have a question related to Fibonacci Heaps. In the decrease-key operation, if it is allowed lose s > 1 children before cut a node and meld it to the root list (promote the node), this alter the overall runtime complexity? I think there are no changes in the complexity due to the change of potencial will be the same. But I am not sure if I am right.
And how can this be proved by the amortized analysis?
I hope you can help me! Thanks in advance!
Tags for this Thread
Click Here to Expand Forum to Full Width
This is a CodeGuru survey question.