A minimum spanning tree algorithm with inverse-Ackermann type complexity (0)

by B Chazelle
Venue:J. ACM