S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe, Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment, Theory of Computing Systems, pp.441-456, 2004.
DOI : 10.1007/s00224-004-1155-5

URL : https://hal.archives-ouvertes.fr/hal-00307618

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

L. Blin, S. Dolev, M. Gradinariu-potop-butucaru, and S. , Fast Self-stabilizing Minimum Spanning Tree Construction, 24th International Symposium on Distributed Computing (DISC), pp.480-494, 2010.
DOI : 10.1007/978-3-642-15763-9_46

URL : https://hal.archives-ouvertes.fr/hal-00492398

L. Blin, M. Potop-butucaru, S. Rovedakis, and S. Tixeuil, A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property, 23rd International Symposium on Distributed Computing (DISC), pp.407-422, 2009.
DOI : 10.1007/978-3-642-04355-0_43

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

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

J. Burman and S. Kutten, Time Optimal Asynchronous Self-stabilizing Spanning Tree, 21st International Symposium on Distributed Computing (DISC), pp.92-107, 2007.
DOI : 10.1007/978-3-540-75142-7_10

S. Dolev, A. Israeli, and S. Moran, Uniform Dynamic Self-Stabilizing Leader Election, IEEE Trans. Parallel Distrib. Syst, vol.84, pp.424-440, 1997.
DOI : 10.1109/71.588622

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

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

G. Antonoiu and P. K. Srimani, Distributed self-stabilizing algorithm for minimum spanning tree construction, 3rd International Conference on Parallel and Distributed Computing, pp.480-487, 1997.
DOI : 10.1007/BFb0002773

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.

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, 15th International Conference on Distributed Computing (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

A. Korman and S. Kutten, Distributed verification of minimum spanning trees, Distributed Computing, pp.253-266, 2007.

A. Korman, S. Kutten, and T. Masuzawa, Fast and compact self stabilizing verification, computation, and fault detection of an MST, 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp.311-320, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01240211

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

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, K. Hagihara, and N. 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. Peleg, Informative Labeling Schemes for Graphs, MFCS, pp.579-588, 2000.

D. Peleg, Distributed Computing: A Locality-Sensitive Approach, Society for Industrial and Applied Mathematics, 2000.
DOI : 10.1137/1.9780898719772

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

R. E. Tarjan, Data Structures and Network Algorithms, 1983.
DOI : 10.1137/1.9781611970265

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

G. Mohamed, N. J. Gouda, and . Multari, Stabilizing Communication Protocols, IEEE Trans. Computers, vol.40, issue.4, pp.448-458, 1991.

P. Flocchini, T. M. Enriquez, L. Pagli, G. Prencipe, and N. Santoro, Distributed Computation of All Node Replacements of a Minimum Spanning Tree, 13th International Conference on Parallel and Distributed Computing, pp.598-607, 2007.
DOI : 10.1007/978-3-540-74466-5_63

P. Flocchini, T. M. Enriquez, L. Pagli, G. Prencipe, and N. Santoro, Distributed Minimum Spanning Tree Maintenance for Transient Node Failures, IEEE Transactions on Computers, vol.61, issue.3, pp.61408-414, 2012.
DOI : 10.1109/TC.2010.228