A minimum spanning tree algorithm with inverse-Ackermann type complexity

Bernard Chazelle
2000 Journal of the ACM  
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m␣(m, n)), where ␣ is the classical functional inverse of Ackermann's function and n (respectively, m) is the number of vertices (respectively, edges). The algorithm is comparison-based: it uses pointers, not arrays, and it makes no numeric assumptions on the edge costs. A preliminary version of this paper appeared as CHAZELLE, B. 1997. A faster deterministic algorithm for minimum spanning trees. In
doi:10.1145/355541.355562 fatcat:5busethsfbhxvczhyn6n55qgvm