G. Antonoiu and P. Srimani, A self-stabilizing distributed algorithm to find the center of a tree graph. Parallel Algorithms and Applications, pp.3-4237, 1997.

L. Blin, F. Boubekeur, and S. Dubois, A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon, 2015 IEEE International Parallel and Distributed Processing Symposium, pp.1065-1074, 2015.
DOI : 10.1109/IPDPS.2015.44
URL : https://hal.archives-ouvertes.fr/hal-01201859

S. Bruell, S. Ghosh, M. Karaata, and S. Pemmaraju, Self-Stabilizing Algorithms for Finding Centers and Medians of Trees, SIAM Journal on Computing, vol.29, issue.2, pp.600-614, 1999.
DOI : 10.1137/S0097539798427156

F. Butelle, C. Lavault, and M. Bui, A uniform self-stabilizing minimum diameter tree algorithm (extended abstract), WDAG'95, pp.257-272, 1995.

L. Blin, M. Potop-butucaru, and S. Rovedakis, A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees, SSS'09, pp.133-148, 2009.
DOI : 10.1007/978-3-642-05118-0_10
URL : https://hal.archives-ouvertes.fr/hal-00363003

L. Blin, M. Potop-butucaru, and S. Rovedakis, Self-stabilizing minimum degree spanning tree within one from the optimal degree, Journal of Parallel and Distributed Computing, vol.71, issue.3, pp.438-449, 2011.
DOI : 10.1016/j.jpdc.2010.08.019
URL : https://hal.archives-ouvertes.fr/hal-01151868

A. Cournier, S. Rovedakis, and V. Villain, The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction, OPODIS'11, pp.159-174, 2011.
DOI : 10.1007/978-3-642-25873-2_12
URL : https://hal.archives-ouvertes.fr/hal-01009450

S. Dolev, A. Israeli, and S. Moran, Resource Bounds for Self-Stabilizing Message-Driven Protocols, SSS'13, pp.273-290, 1997.
DOI : 10.1137/S0097539792235074

A. Datta, L. Larmore, P. Vemuladol00-]-s, . [. Dolev, S. Dubois et al., An -time self-stabilizing leader election algorithm, Self-stabilizing depth-first token circulation on networks. Distributed Computing, pp.1532-154461, 1993.
DOI : 10.1016/j.jpdc.2011.05.008

A. Korman, S. Kutten, and T. Masuzawa, Fast and compact self stabilizing verification, computation, and fault detection of an MST, PODC'11, pp.311-320, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01240211

F. Petit and V. Villain, Time and space optimality of distributed depth-first token circulation algorithms, WDAS'99, pp.91-106, 1999.