Abstract
We give a variant of the pairing heaps that achieves the following amortized costs: O(1) per find-min and insert, O(log logn) per decrease-key and mel......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
