A. Stephen, G. Cyril, K. Haim, and R. Theis, Nearest common ancestors: a survey and a new algorithm for a distributed environment, Theory of Computing Systems, pp.441-456, 2004.

L. Blin, M. Potop-butucaru, S. Rovedakis, and S. Tixeuil, A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property, Lecture Notes in Computer Science, vol.5805, pp.407-422, 2009.
DOI : 10.1007/978-3-642-04355-0_43

URL : https://hal.archives-ouvertes.fr/inria-00384041

J. Park, T. Masuzawa, K. Hagihara, and N. Tokura, Distributed algorithms for reconstructing MST after topology change, 4th International Workshop on Distributed Algorithms (WDAG), pp.122-132, 1990.
DOI : 10.1007/3-540-54099-7_9

J. Park, T. Masuzawa, N. Ken-'ichi-hagihara, and . Tokura, Efficient distributed algorithm to solve updating minimum spanning tree problem, Systems and Computers in Japan, vol.89, issue.25, pp.1-12, 1992.
DOI : 10.1002/scj.4690230301

D. Bein, A. Kumar-datta, and V. Villain, Self-Stablizing Pivot Interval Routing in General Networks, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), pp.282-287, 2005.
DOI : 10.1109/ISPAN.2005.79

W. Edsger and . Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM, vol.17, issue.11, pp.643-644, 1974.

G. Tel, Introduction to distributed algorithm, 2000.
DOI : 10.1017/CBO9781139168724

R. G. Gallager, P. A. Humblet, and P. M. Spira, 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

D. Harel and R. E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984.
DOI : 10.1137/0213024

L. Higham and Z. Liang, Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks, DISC, pp.194-208, 2001.
DOI : 10.1007/3-540-45414-4_14

S. Katz and K. Perry, Self-stabilizing extensions for message-passing systems, Proceedings of the ninth annual ACM symposium on Principles of distributed computing , PODC '90, pp.17-26, 1993.
DOI : 10.1145/93385.93405

K. S. Sandeep, P. K. Gupta, and . Srimani, Self-stabilizing multicast protocols for ad hoc networks, J. Parallel Distrib. Comput, vol.63, issue.1, pp.87-96, 2003.

J. B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, vol.7, issue.1, pp.48-50, 1956.
DOI : 10.1090/S0002-9939-1956-0078686-7

R. C. Prim, Shortest Connection Networks And Some Generalizations, Bell System Technical Journal, vol.36, issue.6, pp.1389-1401, 1957.
DOI : 10.1002/j.1538-7305.1957.tb01515.x