I will discuss a deterministic method for computing
the minimum spanning tree of a connected graph.
The running time is O(m alpha log alpha), where
alpha= alpha(m,n) is an inverse functional
of Ackermann's function, and n (resp. m) is the number
of vertices (resp. edges).
Document last modified on February 27, 1997