A fully distributed (minimal) spanning tree algorithm
An asynchronous distributed algorithm is described which determines a minimum spanning tree of a graph. The algorithm is shown to be superior to that of Gallagher et al.
scientific article; zbMATH DE number 3987293