F. Chin and H. F. , Ting An almost linear time and O(nlogn+e) messages distributed algorithm for minimum-weight spanning trees Proc, 1985.
DOI : 10.1109/sfcs.1985.7

M. Faloutsos and M. Molle, Optimal distributed algorithm for minimum spanning trees revisited, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, 1995.
DOI : 10.1145/224964.225474
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2261

R. G. Gallager, P. A. Humblet, and P. M. , A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems, vol.5, issue.1, pp.66-77, 1983.
DOI : 10.1145/357195.357200

J. A. Garay, S. Kutten, and D. , A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees, SIAM Journal on Computing, vol.27, issue.1, pp.302-316, 1998.
DOI : 10.1137/S0097539794261118

S. Kutten and D. , Peleg Fast distributed construction of small k-dominating sets and applications J. Alg [7] I. Lavalì Ee, G. Roucairol, A fully distributed (minimal) spanning tree algorithm, Information Processing Letters, vol.28, issue.23, pp.40-66, 1986.

D. Peleg and V. Rubinovich, A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction SIAM, J. COMPT, vol.30, issue.5, pp.1427-1442, 2000.

G. Tel, Distributed Control for AI Distributed Artificial Intelligence, 1998.