A minimum spanning tree algorithm with Inverse-Ackermann type complexity

Bernard Chazelle. A minimum spanning tree algorithm with Inverse-Ackermann type complexity. Journal of the ACM, 47(6):1028-1047, 2000. [doi]

Abstract

Abstract is missing.