L. Barrì-ere, P. Fraigniaud, E. Kranakis, and D. Krizanc, Efficient routing in networks with long range contacts, 15th International Symposium on Distributed Computing (DISC '01), vol.2180, pp.270-284, 2001.

I. Benjamini and N. Berger, The diameter of long-range percolation clusters on finite cycles. Random Structures and Algorithms, vol.19, pp.102-111, 2001.

B. Bollobás and F. R. Chung, The diameter of a cycle plus random matching, SIAM J. Discrete Math, vol.1, pp.328-333, 1988.

D. Coppersmith, D. Gamarnik, and M. Sviridenko, The diameter of a long range percolation graph, Random Structures and Algorithms, vol.21, pp.1-13, 2002.

J. Kleinberg, The small-world phenomenon : an algorithmic perspective, Proc. 32nd ACM Symposium on Theory of Computing, pp.163-170, 2000.

J. Kleinberg, Small-world phenomena and the dynamics of information, Advances in Neural Information Processing Systems, vol.14, 2002.

S. Milgram, The small world problem, Psychology Today, issue.1, p.61, 1967.

M. E. Newman, Models of the small world, J. Stat. Phys, vol.101, 2000.

M. E. Newman, The structure and function of complex networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.

M. E. Newman and D. J. Watts, Renormalization group analysis of the small-world network model, Phys. Lett. A, vol.263, pp.341-346, 1999.

D. Watts and S. Strogatz, Collective dynamics of small-world networks, Nature, vol.393, pp.440-442, 1998.

H. Zhang, A. Goel, and R. Govindan, Using the small-world model to improve freenet performance, Proceedings of IEEE INFOCOM, 2002.