B. Awerbuch, I. Cidon, and S. Kutten, Communication-optimal maintenance of replicated information, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, p.492502, 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), pages 3746. Hermès & Inria, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00915195

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

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

D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsication a technique for speeding-up dynamic graph algorithms, Proc. 33rd IEEE FOCS, p.6069, 1992.

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, p.3354, 1992.
DOI : 10.1016/0196-6774(92)90004-V

M. Flammini, Compact routing models : some complexity results and extensions, 1995.

M. Flammini, G. Gambosi, and S. Salomone, Boolean Routing, Proc. 7th Int. Workshop on Distributed Algorithms (WDAG'93), p.219233, 1993.
DOI : 10.1007/3-540-57271-6_38

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

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, p.6677, 1983.
DOI : 10.1145/357195.357200

C. Gavoille and E. Guevremont, Worst Case Bounds for Shortest Path Interval Routing, Journal of Algorithms, vol.27, issue.1, pp.95-97, 1995.
DOI : 10.1006/jagm.1997.0915

J. Ho, D. T. Lee, C. Chang, and C. K. Wong, Minimum diameter spanning trees and related problems, SIAM J. on Computing, vol.20, issue.5, p.987997, 1991.

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, p.103111, 1991.
DOI : 10.1007/3-540-54891-2_8

G. F. Italiano and R. Ramaswani, Maintaining spanning trees of small diameter, Proc. ICALP'94, p.227238, 1994.

C. Lavault, Évaluation des algorithmes distribués analyse, complexité, méthode. Hermès, 1995.

R. Tan and J. Van-leeuwen, Compact routing methods : a survey, Proc. 1st Coll. on Structural Information and Communication Complexity (SIROCCO'94), p.99109, 1995.