B. Awerbuch, Complexity of network synchronization, Journal of the ACM, vol.32, issue.4, pp.804-823, 1985.
DOI : 10.1145/4221.4227

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, I. Cidon, and S. Kutten, Communication-optimal maintenance of replicated information, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.492-502, 1990.
DOI : 10.1109/FSCS.1990.89570

M. Bui and F. Butelle, Minimum diameter spanning tree, Proc. Int. Workshop on Principles of Parallel Computing (OPOPAC'93), pp.37-46, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00915195

F. Butelle, C. Lavault, and M. Bui, A uniform self-stabilizing minimum diameter spanning tree algorithm, Proc. 9th Int. Workshop on Distributed Algorithms (WDAG'95), pp.257-272, 1995.
DOI : 10.1007/BFb0022152
URL : https://hal.archives-ouvertes.fr/hal-00917298

P. M. Camerini, G. Galbiati, and F. Maffioli, Complexity of spanning tree problems: Part I, European Journal of Operational Research, vol.5, issue.5, pp.346-352, 1980.
DOI : 10.1016/0377-2217(80)90164-2

S. Chandrasekaran and S. Venkatesan, A message-optimal algorithm for distributed termination detection, Journal of Parallel and Distributed Computing, vol.8, issue.3, pp.245-252, 1990.
DOI : 10.1016/0743-7315(90)90099-B

N. Christophides, Graph Theory: An algorithmic approach, Computer Science and Applied Mathematics, 1975.

D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook et al., Maintenance of a minimum spanning forest in a dynamic plane graph, Journal of Algorithms, vol.13, issue.1, pp.33-54, 1992.
DOI : 10.1016/0196-6774(92)90004-V

P. Fraigniaud and C. Gavoille, Memory requirement for universal routing schemes, Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing , PODC '95, pp.95-100, 1995.
DOI : 10.1145/224964.224989
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.6386

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

S. L. Hakimi, J. G. Pierce, and E. F. Schmeichel, -Centers in Networks, Transportation Science, vol.12, issue.1, pp.1-15, 1978.
DOI : 10.1287/trsc.12.1.1
URL : https://hal.archives-ouvertes.fr/hal-00309512

J. Ho, D. T. Lee, C. Chang, and C. K. Wong, Minimum Diameter Spanning Trees and Related Problems, SIAM Journal on Computing, vol.20, issue.5, pp.987-997, 1991.
DOI : 10.1137/0220060

E. Ihler, G. Reich, and P. Widmayer, On shortest networks for classes of points in the plane, Proc. Int. Workshop on Computational Geometry ? Methods, Algorithms and Applications, Lecture Notes in Computer Science. 103-111, 1991.
DOI : 10.1007/3-540-54891-2_8

G. F. Italiano and R. Ramaswani, Maintaining spanning trees of small diameter, Proc. ICALP'94, pp.227-238, 1994.

L. Lamport, Time, clocks, and the ordering of events in a distributed system, Communications of the ACM, vol.21, issue.7, pp.558-565, 1978.
DOI : 10.1145/359545.359563

L. Lamport, An assertional correctness proof of a distributed algorithm, Sci. Computer Programming, pp.175-206, 1982.
DOI : 10.1016/0167-6423(83)90014-X

]. C. Lavault, ´ Evaluation des algorithmes distribués ? analyse, complexité, méthode, Hermès, 1995.

N. Lynch, Distributed Algorithms, 1996.