Bernard Chazelle. A minimum spanning tree algorithm with Inverse-Ackermann type complexity. Journal of the ACM, 47(6):1028-1047, 2000. [doi]
@article{Chazelle00a,
title = {A minimum spanning tree algorithm with Inverse-Ackermann type complexity},
author = {Bernard Chazelle},
year = {2000},
doi = {10.1145/355541.355562},
url = {http://doi.acm.org/10.1145/355541.355562},
researchr = {https://researchr.org/publication/Chazelle00a},
cites = {0},
citedby = {0},
journal = {Journal of the ACM},
volume = {47},
number = {6},
pages = {1028-1047},
}