A Sub-Linear Time Distributed Algorithm for
Minimum-Weight Spanning Trees
Juan A. Garay \Lambda Shay Kutten y David Peleg z
April 20, 1995
Abstract
This paper considers the question of identifying the parameters governing the behavior of fundamental global network
problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful
when an O(n) bound is achieved on an n-vertex network. We propose that a more sensitive parameter is the network's
diameter Diam. This is demonstrated in the paper by providing a distributed Minimum-weight Spanning Tree algorithm
whose time complexity is sub-linear in n, but linear in Diam (specically, O(Diam(G) + n"*log*n) for " = ln3/ln 6 =
0:6131::). Our result is achieved through the application of graph decomposition and edge- elimination- by-
pipelining techniques that may be of independent interest.