A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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. Indoi:10.1145/355541.355562 fatcat:5busethsfbhxvczhyn6n55qgvm