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

Y. Afek, S. Kutten, and M. Yung, Memory-efficient self stabilizing protocols for general networks, Proceedings of the 4th international workshop on Distributed algorithms, pp.15-28, 1991.
DOI : 10.1007/3-540-54099-7_2

S. Aggarwal and S. Kutten, Time optimal self-stabilizing spanning tree algorithms, 13th Conference on Foundations of Software Technology and Theoretical Computer Science, pp.400-410, 1993.
DOI : 10.1007/3-540-57529-4_72

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

I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares, On sparse spanners of weighted graphs, Discrete & Computational Geometry, vol.6, issue.1, pp.81-100, 1993.
DOI : 10.1007/BF02189308

A. Arora and M. G. Gouda, Distributed reset, Lecture Notes in Computer Science, vol.472, pp.316-331, 1990.
DOI : 10.1007/3-540-53487-3_54

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

S. Fujita, I. Suzuki, M. Yamashita, and Y. Asahiro, A self-stabilizing marching algorithm for a group of oblivious robots, 12th International Conference on Principles of Distributed Systems, pp.125-144, 2008.

B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.230-240, 1987.
DOI : 10.1145/28395.28421

B. Awerbuch, O. Goldreich, D. Peleg, and R. Vainish, A trade-off between information and communication in broadcast protocols, Journal of the ACM, vol.37, issue.2, pp.238-256, 1990.
DOI : 10.1145/77600.77618

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, pp.652-661, 1993.
DOI : 10.1145/167088.167256

F. Baille, L. Blin, and C. Laforest, Distributed Approximation Allocation Resources Algorithm for Connecting Groups, 12th International Conference on Parallel Processing, pp.519-529, 2006.
DOI : 10.1007/11823285_54

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

R. Baldoni, F. Bonnet, A. Milani, and M. Raynal, On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots, 12th International Conference on 58 BIBLIOGRAPHIE Principles of Distributed Systems, pp.428-445, 2008.
DOI : 10.1109/AINA.2007.44

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

P. Lalibarrì-ere, P. Flocchini, N. Fraigniaud, and . Santoro, Can we elect if we cannot compare ?, Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp.324-332, 2003.

J. Beauquier, T. Herault, and E. Schiller, Easy Stabilization with an Agent, 5th Workshop on Self-Stabilizing Systems (WSS), pp.35-51, 2001.
DOI : 10.1007/3-540-45438-1_3

P. Berman and V. Ramaiyer, Improved Approximations for the Steiner Tree Problem, Journal of Algorithms, vol.17, issue.3, pp.381-408, 1994.
DOI : 10.1006/jagm.1994.1041

L. Blin and F. Butelle, THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS, International Journal of Foundations of Computer Science, vol.15, issue.03, pp.507-516, 2004.
DOI : 10.1142/S0129054104002571

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

L. Blin, A. Cournier, and V. Villain, An Improved Snap-Stabilizing PIF Algorithm, 6th International Symposium on Self-Stabilizing Systems, pp.199-214, 2003.
DOI : 10.1007/3-540-45032-7_15

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

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

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

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, 24th International Symposium on Distributed Computing, pp.312-327, 2010.
DOI : 10.1007/978-3-642-15763-9_29

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

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, pp.407-422, 2009.
DOI : 10.1007/978-3-642-04355-0_43

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

L. Blin, M. Gradinariu-potop-butucaru, and S. Rovedakis, Self-stabilizing minimum-degree spanning tree within one from the optimal degree, 23rd IEEE International Symposium on Parallel and Distributed Processing, pp.1-11, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01151868

L. Blin, M. Gradinariu-potop-butucaru, and S. Rovedakis, A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees, 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.133-148, 2009.
DOI : 10.1007/978-3-642-05118-0_10

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

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

L. Blin, M. Gradinariu-potop-butucaru, S. Rovedakis, and S. Tixeuil, Loop-Free Super-Stabilizing Spanning Tree Construction, 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.50-64, 2010.
DOI : 10.1007/978-3-642-16023-3_7

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

L. Blin, M. Gradinariu-potop-butucaru, and S. Tixeuil, On the Self-stabilization of Mobile Robots in Graphs, 11th International Conference on Principles of Distributed Systems, pp.301-314, 2007.
DOI : 10.1007/978-3-540-77096-1_22

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

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

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

F. Butelle, C. Lavault, and M. Bui, A uniform self-stabilizing minimum diameter spanning tree algorithm, 9th International Workshop on Distributed Algorithms, pp.257-272, 1995.
DOI : 10.1007/BFb0022152

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

J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità, An improved LP-based approximation for steiner tree, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.583-592, 2010.
DOI : 10.1145/1806689.1806769

J. Chalopin, E. Godard, Y. Métivier, and R. Ossamy, Mobile Agent Algorithms Versus Message Passing Algorithms, Principles of Distributed Systems, 10th International Conference, pp.187-201, 2006.
DOI : 10.1007/11945529_14

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

J. Chalopin, P. Flocchini, B. Mans, and N. Santoro, Network Exploration by Silent and Oblivious Robots, 36th International workshop on Graph Theory Concepts in Computer Science, pp.208-219, 2010.
DOI : 10.1137/S009753979628292X

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

K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar, What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsAPPROX 2005) and 9th InternationalWorkshop on Randomization and Computation, pp.26-39, 2005.
DOI : 10.1007/11538462_3

K. Chaudhuri, S. Rao, S. Riesenfeld, and K. Talwar, A Push-Relabel Algorithm for Approximating Degree Bounded MSTs, 33rd International Colloquium in Automata , Languages and Programming, pp.191-201, 2006.
DOI : 10.1007/11786986_18

G. Chen, M. E. Houle, and M. Kuo, The steiner problem in distributed computing systems, Inf. Sci, vol.74, issue.12, pp.73-96, 1993.

G. Flocchini-p.-prencipe, N. Santoro, and M. Cieliebak, Solving the robots gathering problem, ICALP 2003, pp.1181-1196, 2003.

J. A. , C. , and M. G. Gouda, Stabilization of general loop-free routing, J. Parallel Distrib. Comput, vol.62, issue.5, pp.922-944, 2002.

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. Kumar-datta, F. Petit, and V. Villain, Snap-stabilizing PIF algorithm in arbitrary networks, Proceedings 22nd International Conference on Distributed Computing Systems, p.199, 2002.
DOI : 10.1109/ICDCS.2002.1022257

A. Cournier, A. Kumar-datta, F. Petit, and V. Villain, Optimal snapstabilizing pif algorithms in un-oriented trees, High Speed Networks, pp.185-200, 2005.

K. Yogen and . Dalal, A distributed algorithm for constructing minimal spanning trees, 1979.

K. Yogen and . Dalal, A distributed algorithm for constructing minimal spanning trees, IEEE Trans. Software Eng, vol.13, issue.3, pp.398-405, 1987.

P. Danturi, M. Nesterenko, and S. Tixeuil, Self-stabilizing philosophers with generic conflicts, TAAS, vol.4, issue.1, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01151770

A. Kumar-datta, M. Gradinariu, and S. Tixeuil, Self-stabilizing mutual exclusion using unfair distributed scheduler, 14th International Parallel & Distributed Processing Symposium, (IPDPS'00), p.465, 2000.

A. Kumar-datta, C. Johnen, F. Petit, and V. Villain, Self-stabilizing depthfirst token circulation in arbitrary rooted networks, Distributed Computing, pp.207-218, 2000.

A. Kumar-datta, L. L. Larmore, and P. Vemula, Self-Stabilizing Leader Election in Optimal Space, 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems, pp.109-123, 2008.
DOI : 10.4086/cjtcs.1997.004

A. Dessmark, P. Fraigniaud, D. R. Kowalski, and A. Pelc, Deterministic Rendezvous in Graphs, Algorithmica, vol.46, issue.1, pp.69-96, 2006.
DOI : 10.1007/s00453-006-0074-2

S. Devisme, Quelques ContributionsàContributionsà la Stabilisation Instantanée, 2006.

S. Devismes, F. Petit, and S. Tixeuil, Optimal Probabilistic Ring Exploration by Semi-synchronous Oblivious Robots, 16th International Colloquium on Structural Information and Communication Complexity, pp.195-208, 2009.
DOI : 10.1016/j.tcs.2008.04.042

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

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

S. Dolev, E. Schiller, and J. Welch, Random walk for self-stabilizing group communication in ad-hoc networks. Reliable Distributed Systems, Proceedings. 21st IEEE Symposium on, pp.70-79, 2002.

S. Dolev, Optimal time self stabilization in dynamic systems, Lecture Notes in Computer Science, vol.725, pp.160-173, 1993.
DOI : 10.1007/3-540-57271-6_34

S. Dolev, M. G. Gouda, and M. Schneider, Memory requirements for silent stabilization (extended abstract), 15th Annual ACM Symposium on Principles of Distributed Computing, pp.27-34, 1996.

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

S. Dolev, A. Israeli, and S. Moran, Self-stabilization of dynamic systems assuming only read/write atomicity, 9th Annual ACM Symposium on Principles of Distributed Computing, pp.103-117, 1990.
DOI : 10.1007/BF02278851

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

S. Dolev, A. Israeli, and S. Moran, Uniform dynamic self-stabilizing leader election, IEEE Transactions on Parallel and Distributed Systems, vol.8, issue.4, pp.424-440, 1997.
DOI : 10.1109/71.588622

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

-. S. Souissi and X. Défago, Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity, Theor. Comput. Sci, vol.396, issue.1-3, pp.97-112, 2008.

T. Fischer, Optimizing the degree of minimum weight spanning trees, 1993.

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots, 11th International Conference on Principles of Distributed Systems, pp.105-118, 2007.
DOI : 10.1007/978-3-540-77096-1_8

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

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots, 15th International Colloquium on Structural Information and Communication Complexity, pp.33-47, 2008.
DOI : 10.1007/978-3-540-69355-0_5

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

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Remembering without memory : Tree exploration by asynchronous oblivious robots, Theor. Comput. Sci, vol.411, pp.14-151583, 2008.
DOI : 10.1016/j.tcs.2010.01.007

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

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots, 10th International Symposium onAlgorithms and Computation, pp.93-102, 1999.
DOI : 10.1007/3-540-46632-0_10

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Arbitrary pattern formation by asynchronous, anonymous, oblivious robots, Theoretical Computer Science, vol.407, issue.1-3, pp.412-447, 2008.
DOI : 10.1016/j.tcs.2008.07.026

URL : http://doi.org/10.1016/j.tcs.2008.07.026

N. Greg, N. A. Frederickson, and . Lynch, The impact of synchronous communication on the problem of electing a leader in a ring, Sixteenth Annual ACM Symposium on Theory of Computing, pp.493-503, 1984.

L. Michael, D. E. Fredman, and . Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, 31st Annual Symposium on Foundations of Computer ScienceFOCS 1990), volume II, pp.719-725, 1990.

M. Fürer and B. Raghavachari, Approximating the minimum degree spanning tree to within one from the optimal degree, Third Annual ACM/SIGACT-SIAM Symposium on Discrete AlgorithmsSODA 92), pp.317-324, 1992.

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

M. Eli, P. Gafni, and . Bertsekas, Distributed algorithms for generating loop-free routes in networks with frequently changing topology, IEEE Transactions on Communications, vol.29, issue.3, pp.11-18, 1981.

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

J. A. Garay, S. Kutten, and D. Peleg, A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees, SIAM Journal on Computing, vol.27, issue.1, pp.302-316, 1998.
DOI : 10.1137/S0097539794261118

J. J. Garcia-luna-aceves, Loop-free routing using diffusing computations, IEEE/ACM Transactions on Networking, vol.1, issue.1, pp.130-141, 1993.
DOI : 10.1109/90.222913

C. Felix and . Gärtner, A survey of self-stabilizing spanning-tree construction algorithms, 2003.

L. Gatani, G. Lo-re, and S. Gaglio, A Dynamic Distributed Algorithm for Multicast Path Setup, 11th International Euro-Par Parallel Processing ConferenceEuro- Par 2005), pp.595-605, 2005.
DOI : 10.1007/11549468_67

S. Ghosh, Agents, Distributed Algorithms, and Stabilization, Computing and Combinatorics (COCOON, pp.242-251, 2000.
DOI : 10.1007/3-540-44968-X_24

X. Michel and . Goemans, Minimum bounded degree spanning trees, 47th Annual IEEE Symposium on Foundations of Computer Science, pp.273-282, 2006.

G. Mohamed, M. Gouda, and . Schneider, Stabilization of maximal metric trees, Workshop on Self-stabilizing SystemsWSS 1999), pp.10-17, 1999.

K. S. Sandeep, P. K. Gupta, and . Srimani, Using self-stabilization to design adaptive multicast protocol for mobile ad hoc networks, Workshop on Mobile Networks and ComputingDIMACS 99). Rutgers University, 1999.

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

T. Herman and T. Masuzawa, Self-Stabilizing Agent Traversal, WSS01 Proceedings of the Fifth International Workshop on Self-Stabilizing Systems, pp.152-166, 2001.
DOI : 10.1007/3-540-45438-1_11

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

. Shing-tsaan, N. Huang, and . Chen, A self-stabilizing algorithm for constructing breadth-first trees, Inf. Process. Lett, vol.41, issue.2, pp.109-117, 1992.

. Shing-tsaan, N. Huang, and . Chen, Self-stabilizing depth-first token circulation on networks, Distributed Computing, vol.7, issue.1, pp.61-66, 1993.

. Shing-tsaan, L. Huang, and . Wuu, Self-stabilizing token circulation in uniform networks, Distributed Computing, vol.10, issue.4, pp.181-187, 1997.

C. Tetz, J. Huang, and . Lin, A self-stabilizing algorithm for the shortest path problem in a distributed system, Computers & Mathematics with Applications, vol.43, issue.12, pp.103-109, 2002.

M. Imase and B. M. Waxman, Dynamic Steiner Tree Problem, SIAM Journal on Discrete Mathematics, vol.4, issue.3, pp.369-384, 1991.
DOI : 10.1137/0404033

URL : http://openscholarship.wustl.edu/cgi/viewcontent.cgi?article=1725&context=cse_research

K. Jain, A factor 2 approximation algorithm for the generalized Steiner network problem, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.448-457, 1998.
DOI : 10.1109/SFCS.1998.743495

C. Johnen and S. Tixeuil, Route Preserving Stabilization, Self-Stabilizing Systems, pp.184-198, 2003.
DOI : 10.1007/3-540-45032-7_14

H. Kakugawa and M. Yamashita, Uniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon, Journal of Parallel and Distributed Computing, vol.62, issue.5, pp.885-898, 2002.
DOI : 10.1006/jpdc.2001.1831

S. Kamei and H. Kakugawa, A self-stabilizing algorithm for the Steiner tree problem, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., p.396, 2002.
DOI : 10.1109/RELDIS.2002.1180217

S. Kamei and H. Kakugawa, A self-stabilizing algorithm for the Steiner tree problem, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., pp.299-307, 2004.
DOI : 10.1109/RELDIS.2002.1180217

R. David, P. N. Karger, R. E. Klein, and . Tarjan, A randomized linear-time algorithm to find minimum spanning trees, J. ACM, vol.42, issue.2, pp.321-328, 1995.

R. Klasing, A. Kosowski, and A. Navarra, Taking Advantage of Symmetries: Gathering of Asynchronous Oblivious Robots on a Ring, 12th International Conference on Principles of Distributed Systems, pp.446-462, 2008.
DOI : 10.1137/S009753979628292X

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

R. Klasing, E. Markou, and A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, vol.390, issue.1, pp.27-39, 2008.
DOI : 10.1016/j.tcs.2007.09.032

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

J. Könemann and R. Ravi, A matter of degree, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.537-546, 2000.
DOI : 10.1145/335305.335371

J. Könemann and R. Ravi, A matter of degree, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.1783-1793, 2002.
DOI : 10.1145/335305.335371

J. Könemann and R. Ravi, Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds, SIAM Journal on Computing, vol.34, issue.3, pp.763-773, 2005.
DOI : 10.1137/S0097539702418048

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

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

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, pp.311-320, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01240211

S. Kutten and D. Peleg, Fast Distributed Construction of Smallk-Dominating Sets and Applications, Journal of Algorithms, vol.28, issue.1, pp.40-66, 1998.
DOI : 10.1006/jagm.1998.0929

C. Lavault and M. Valencia-pabon, A distributed approximation algorithm for the minimum degree minimum weight spanning trees, Journal of Parallel and Distributed Computing, vol.68, issue.2, pp.200-208, 2008.
DOI : 10.1016/j.jpdc.2007.07.005

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

Z. Lotker, B. Patt-shamir, and D. Peleg, Distributed mst for constant diameter graphs, 20th Annual ACM Symposium on Principles of Distributed Computing, pp.63-71, 2001.
DOI : 10.1007/s00446-005-0127-6

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

J. Park, T. Masuzawa, K. Hagihara, and N. Tokura, Distributed algorithms for reconstructing MST after topology change, 4th International Workshop on Distributed Algorithms, 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, Distributed computing : a locality-sensitive approach, Society for Industrial and Applied Mathematics, 2000.
DOI : 10.1137/1.9780898719772

D. Peleg and V. Rubinovich, A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction, SIAM Journal on Computing, vol.30, issue.5, pp.1427-1442, 2000.
DOI : 10.1137/S0097539700369740

F. Petit and V. Villain, Optimal snap-stabilizing depth-first token circulation in tree networks, Journal of Parallel and Distributed Computing, vol.67, issue.1, pp.1-12, 2007.
DOI : 10.1016/j.jpdc.2006.08.008

S. Pettie and V. Ramachandran, An optimal minimum spanning tree algorithm, Journal of the ACM, vol.49, issue.1, pp.16-34, 2002.
DOI : 10.1145/505241.505243

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

G. Prencipe, Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots, 7th Italian Conference on Theoretical Computer Science, pp.154-171, 2001.
DOI : 10.1007/3-540-45446-2_10

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

H. Jürgen, P. , and A. Steger, Rnc-approximation algorithms for the steiner problem, 14th Annual Symposium on Theoretical Aspects of Computer Science, pp.559-570, 1997.

V. Sridhar-rajagopalan and . Vazirani, On the bidirected cut relaxation for the metric steiner tree problem, Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999.

R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, H. B. Hunt et al., Many birds with one stone, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.438-447, 1993.
DOI : 10.1145/167088.167209

G. Robins and A. Zelikovsky, Tighter Bounds for Graph Steiner Tree Approximation, SIAM Journal on Discrete Mathematics, vol.19, issue.1, pp.122-134, 2005.
DOI : 10.1137/S0895480101393155

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

S. Rovedakis, Algorithmes auto-stabilisants de constructions d'arbres couvrants, 2009.

N. Santoro, Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing), 2006.

M. Singh and L. C. Lau, Approximating minimum bounded degree spanning trees to within one of optimal, 39th Annual ACM Symposium on Theory of Computing, pp.661-670, 2007.

D. D. Sleator and R. E. Tarjan, A data structure for dynamic trees, Proceedings of the thirteenth annual ACM symposium on Theory of computing , STOC '81, pp.362-391, 1983.
DOI : 10.1145/800076.802464

URL : http://doi.org/10.1016/0022-0000(83)90006-5

G. Sollin, Exposé au séminaire de c. berge, ihp. repris in extenso dans méthodes et modèles de la recherche opérationnelle, pp.33-45, 1961.

I. Suzuki and M. Yamashita, Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.36, issue.1, pp.279-280, 2006.
DOI : 10.1137/050631562

I. Suzuki and M. Yamashita, Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999.
DOI : 10.1137/S009753979628292X

H. Takahashi and A. Matsuyama, An approximate solution for the steiner problem in graphs, Math. Jap, vol.24, pp.573-577, 1980.

. Robert-endre-tarjan, Applications of path compression on balanced trees, J. ACM, vol.26, pp.1-38, 1979.

G. Tel, Introduction to distributed algorithms, 1994.
DOI : 10.1017/CBO9781139168724

URL : http://dx.doi.org/10.1016/s0898-1221(97)90063-8

P. Tetali and P. Winkler, On a random walk problem arising in self-stabilizing token management, Proceedings of the tenth annual ACM symposium on Principles of distributed computing , PODC '91, pp.273-280, 1990.
DOI : 10.1145/112600.112623

S. Tixeuil, Vers l'auto-stabilisation des systèmessystèmesà grande echelle. HabilitationàHabilitationà diriger les recherches, 2006.

Y. Wu, P. Widmayer, and C. K. Wong, A faster approximation algorithm for the Steiner problem in graphs, Acta Informatica, vol.24, issue.2, pp.223-229, 1986.
DOI : 10.1007/BF00289500

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-89, 1996.
DOI : 10.1145/62546.62568

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.90-96, 1996.
DOI : 10.1145/62546.62568

M. Yamashita and I. Suzuki, Characterizing geometric patterns formable by oblivious anonymous mobile robots, Theoretical Computer Science, vol.411, issue.26-28, pp.26-282433, 2008.
DOI : 10.1016/j.tcs.2010.01.037

URL : http://doi.org/10.1016/j.tcs.2010.01.037

A. Zelikovsky, An 11/6-approximation algorithm for the network steiner problem, Algorithmica, vol.17, issue.5, pp.463-470, 1993.
DOI : 10.1007/BF01187035