Y. Afek, S. Kutten, and M. Yung, Memory-efficient self stabilizing protocols for general networks, 4th Int. Workshop on Distributed Algorithms (WDAG), pp.15-28, 1990.
DOI : 10.1007/3-540-54099-7_2

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, vol.37, issue.3, pp.441-456, 2004.
DOI : 10.1007/s00224-004-1155-5
URL : https://hal.archives-ouvertes.fr/hal-00307618

J. Beauquier, M. Gradinariu, and C. Johnen, Memory space requirements for self-stabilizing leader election protocols, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, pp.199-207, 1999.
DOI : 10.1145/301308.301358

L. Blin and P. Fraigniaud, Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction, p.2496, 2014.

L. Blin, M. Gradinariu-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

S. Dolev, M. G. Gouda, and M. Schneider, Memory requirements for silent stabilization, Acta Informatica, vol.36, issue.6, pp.447-462, 1999.
DOI : 10.1007/s002360050180

P. Fraigniaud, Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode, 9th European Symposium on Algorithms (ESA), pp.440-451, 2001.
DOI : 10.1007/3-540-44676-1_37

M. Fürer and B. Raghavachari, Approximating the Minimum-Degree Steiner Tree to within One of Optimal, Journal of Algorithms, vol.17, issue.3, pp.409-423, 1994.
DOI : 10.1006/jagm.1994.1042

R. Kawatra, A multiperiod degree constrained minimal spanning tree problem, European Journal of Operational Research, vol.143, issue.1, pp.53-63, 2002.
DOI : 10.1016/S0377-2217(01)00321-6

A. Korman and S. Kutten, Distributed verification of minimum spanning trees, Distributed Computing, vol.26, issue.1, pp.253-266, 2007.
DOI : 10.1007/s00446-007-0025-1

A. Korman, S. Kutten, and D. Peleg, Proof labeling schemes, Distributed Computing, vol.34, issue.2, pp.215-233, 2010.
DOI : 10.1007/s00446-010-0095-3

D. Peleg, Informative labeling schemes for graphs, Theoretical Computer Science, vol.340, issue.3, pp.577-593, 2005.
DOI : 10.1016/j.tcs.2005.03.015