Y. Afek and A. Bremler-barr, Self-stabilizing unidirectional network algorithms by power supply, Chicago J. Theor. Comput. Sci, 1998.

Y. Afek and S. Dolev, Local Stabilizer, Journal of Parallel and Distributed Computing, vol.62, issue.5, pp.745-765, 2002.
DOI : 10.1006/jpdc.2001.1823

Y. Afek, S. Kutten, and M. Yung, Memory-efficient self stabilizing protocols for general networks, proc. WDAG, 1990.
DOI : 10.1007/3-540-54099-7_2

Y. Afek, S. Kutten, and M. Yung, The local detection paradigm and its applications to self-stabilization, Theoretical Computer Science, vol.186, issue.1-2, pp.199-229, 1997.
DOI : 10.1016/S0304-3975(96)00286-1

T. Akiyama, T. Nishizeki, and N. Saito, NP-completeness of the Hamiltonian cycle problem for bipartite graphs, J. of Information Processing, vol.3, issue.2, p.7376, 1980.

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

A. Arora and M. Gouda, Distributed reset, IEEE Transactions on Computers, vol.43, issue.9, pp.1026-1038, 1994.
DOI : 10.1109/12.312126

B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-shamir, and G. Varghese, Time optimal self-stabilizing synchronization, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, 1993.
DOI : 10.1145/167088.167256

B. Awerbuch, B. Patt-shamir, and G. Varghese, Self-stabilization by local checking and correction, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, 1991.
DOI : 10.1109/SFCS.1991.185378

J. Beauquier, S. Delaët, S. Dolev, and S. Tixeuil, Transient fault detectors, Distributed Computing, vol.7, issue.1, pp.39-51, 2007.
DOI : 10.1007/s00446-007-0029-x

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
DOI : 10.1145/301308.301358

L. Blin, F. Boubekeur, and S. Dubois, A Self-Stabilizing Memory Efficient Algorithm for the Min-Diameter Spanning Tree, proc, 2015.

L. Blin, S. Dolev, M. Gradinariu, and S. Rovedakis, Fast Self-stabilizing Minimum Spanning Tree Construction, 2010.
DOI : 10.1007/978-3-642-15763-9_46
URL : https://hal.archives-ouvertes.fr/hal-00492398

L. Blin and P. Fraigniaud, Polynomial-Time Space-Optimal Silent Self- Stabilizing Minimum-Degree Spanning Tree Construction, 2014.
DOI : 10.1007/978-3-642-15763-9_46
URL : http://arxiv.org/abs/1006.3141

L. Blin, P. Fraigniaud, and B. Patt-shamir, On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms
DOI : 10.1007/978-3-319-11764-5_2
URL : https://hal.archives-ouvertes.fr/hal-01102123

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

L. Blin, M. Gradinariu, S. Rovedakis, and S. Tixeuil, A new selfstabilizing minimum spanning tree construction with loop-free property, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00384041

J. Burman and S. Kutten, Time Optimal Asynchronous Self-stabilizing Spanning Tree, proc. DISC, 2007.
DOI : 10.1007/978-3-540-75142-7_10

B. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann type complexity, Journal of the ACM, vol.47, issue.6, pp.1028-1047, 2000.
DOI : 10.1145/355541.355562

N. Chen, H. Yu, and S. Huang, A self-stabilizing algorithm for constructing spanning trees, Information Processing Letters, vol.39, issue.3, pp.147-151, 1991.
DOI : 10.1016/0020-0190(91)90111-T

Z. Collin and S. Dolev, Self-stabilizing depth-first search, Information Processing Letters, vol.49, issue.6, pp.297-301, 1994.
DOI : 10.1016/0020-0190(94)90103-1

A. Cournier, A New Polynomial Silent Stabilizing Spanning-Tree Construction Algorithm, 2009.
DOI : 10.1109/71.588622

A. Cournier, S. Devismes, and V. Villain, Light enabling snapstabilization of fundamental protocols, ACM Transactions on Autonomous and Adaptive Systems, vol.4, issue.1, 2009.

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

A. Datta, L. Larmore, and P. , Self-stabilizing leader election in optimal space under an arbitrary scheduler, Theoretical Computer Science, vol.412, issue.40, pp.5541-5561, 2011.
DOI : 10.1016/j.tcs.2010.05.001

E. Dijkstra, Self-stabilizing systems in spite of distributed control, Communications of the ACM, vol.17, issue.11, pp.643-644, 1974.
DOI : 10.1145/361179.361202

S. Dolev, Self Stabilization, Journal of Aerospace Computing, Information, and Communication, vol.1, issue.6, 2000.
DOI : 10.2514/1.10141
URL : https://hal.archives-ouvertes.fr/inria-00627780

S. Dolev, M. G. Gouda, and M. Schneider, Memory Requirements for Silent Stabilization Superstabilizing protocols for dynamic distributed systems, Acta Inf. Chicago J. of Theo. Comp. Sc, vol.36, issue.6, pp.447-462140, 1997.

S. Dolev, A. Israeli, and S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, Distributed Computing, vol.15, issue.7, pp.3-16, 1993.
DOI : 10.1007/BF02278851

P. Fraigniaud, Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode, proc, 2001.
DOI : 10.1007/3-540-44676-1_37

P. Fraigniaud, A. Korman, and E. Lebhar, Local MST computation with short advice, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '07, 2007.
DOI : 10.1145/1248377.1248402
URL : https://hal.archives-ouvertes.fr/hal-00154849

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. Gallager, P. Humblet, and P. 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

M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NPcomplete problems, proc. STOC, 1974.
DOI : 10.1145/800119.803884

B. Gavish, Topological design of centralized computer networks???formulations and algorithms, Networks, vol.4, issue.4, pp.355-377, 1982.
DOI : 10.1002/net.3230120402

E. Gilbert and E. Moore, Variable-Length Binary Encodings, Bell System Technical Journal, vol.38, issue.4, pp.933-967, 1959.
DOI : 10.1002/j.1538-7305.1959.tb01583.x

S. Gupta, A. Bouabdallah, and P. Srimani, Self-stabilizing protocol for shortest path tree for multicast routing in mobile networks, EuroPar, 2000.

S. Gupta and P. Srimani, Self-stabilizing multicast protocols for ad hoc networks, Journal of Parallel and Distributed Computing, vol.63, issue.1, pp.87-96, 2003.
DOI : 10.1016/S0743-7315(02)00029-1

D. Harel and R. 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, proc. DISC, 2001.
DOI : 10.1007/3-540-45414-4_14

S. Huang and N. Chen, A self-stabilizing algorithm for constructing breadth-first trees, Information Processing Letters, vol.41, issue.2, pp.109-117, 1992.
DOI : 10.1016/0020-0190(92)90264-V

S. Huang and N. Chen, Self-stabilizing depth-first token circulation on networks, Distributed Computing, vol.3, issue.4, pp.61-66, 1993.
DOI : 10.1007/BF02278857

S. Huang, A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity, Journal of Computer and System Sciences, vol.71, issue.1, pp.70-85, 2005.
DOI : 10.1016/j.jcss.2004.12.011

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. Itai, C. H. Papadimitriou, and J. L. Szwarcfiter, Hamilton Paths in Grid Graphs, SIAM Journal on Computing, vol.11, issue.4, pp.676-686, 1982.
DOI : 10.1137/0211056

G. Itkis and L. A. Levin, Fast and lean self-stabilizing asynchronous protocols, Proceedings 35th Annual Symposium on Foundations of Computer Science, 1994.
DOI : 10.1109/SFCS.1994.365691

C. Johnen, Memory efficient, self-stabilizing algorithm to construct BFS spanning trees, Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing , PODC '97, 1997.
DOI : 10.1145/259380.259508

P. Klein, R. Krishnan, B. Raghavachari, and R. Ravi, Approximation algorithms for finding low-degree subgraphs, Networks, vol.5, issue.3, pp.203-215, 2004.
DOI : 10.1002/net.20031

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 T. Masuzawa, Fast and compact self stabilizing verification, computation, and fault detection of MST, PODC, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01240211

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

A. Kosowski and L. Kuszner, A Self-stabilizing Algorithm for Finding a??Spanning Tree in a Polynomial Number of Moves, 2005.
DOI : 10.1007/11752578_10

S. C. Narula and C. A. Ho, Degree-constrained minimum spanning tree, Computers & Operations Research, vol.7, issue.4, pp.239-249, 1980.
DOI : 10.1016/0305-0548(80)90022-2

J. Nesetril, E. Milková, and H. Nesetrilová, Otakar Bor??vka on minimum spanning tree problem Translation of both the 1926 papers, comments, history, Discrete Mathematics, vol.233, issue.1-3, pp.3-36, 2001.
DOI : 10.1016/S0012-365X(00)00224-7

D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, 2000.
DOI : 10.1137/1.9780898719772

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

M. Singh and L. C. Lau, Approximating minimum bounded degree spanning trees to within one of optimal, proc.STOC, 2007.