L. A. Adamic, R. M. Lukose, A. R. Puniyani, and B. A. Huberman, Search in power-law networks, Physical Review E, vol.64, issue.4, p.46135, 2001.
DOI : 10.1103/PhysRevE.64.046135

A. Chaintreau, P. Fraigniaud, and E. Lebhar, Networks Become Navigable as Nodes Move and Forget, Proc. 35th Int. Colloq. on Automata, Languages and Programming (ICALP), pp.133-144, 2008.
DOI : 10.1007/978-3-540-70575-8_12
URL : https://hal.archives-ouvertes.fr/inria-00257962

F. R. Chung and L. Lu, The Average Distance in a Random Graph with Given Expected Degrees, Internet Mathematics, vol.1, issue.1, pp.91-113, 2003.
DOI : 10.1080/15427951.2004.10129081

P. Duchon, N. Hanusse, E. Lebhar, and N. Schabanel, Could any graph be turned into a small-world ? Theoretical Computer Science, pp.96-103, 2006.

P. S. Dodds, R. Muhamad, and D. J. Watts, An Experimental Study of Search in Global Social Networks, Science, vol.301, issue.5634, pp.827-829, 2003.
DOI : 10.1126/science.1081058

P. Fraigniaud, P. Gauron, and M. Latapy, Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System, Proc. 11th European Conf. on Parallel Computing (Euro-Par), pp.1163-1172, 2005.
DOI : 10.1007/11549468_127

J. Kleinberg, The small-world phenomenon, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.163-170, 2000.
DOI : 10.1145/335305.335325

J. Kleinberg, Complex networks and decentralized search algorithms, Proc. International Congress of Mathematicians (ICM), 2006.
DOI : 10.4171/022-3/50

R. Kumar, D. Liben-nowell, and A. Tomkins, Navigating Low-Dimensional and Hierarchical Population Networks, Proc. 14th Ann. European Symp. on Algorithms (ESA), pp.480-491, 2006.
DOI : 10.1007/11841036_44

B. Kim, C. Yoon, S. Han, and H. Jeong, Path finding strategies in scale-free networks, Physical Review E, vol.65, issue.2, p.27103, 2002.
DOI : 10.1103/PhysRevE.65.027103

. Lnnk-+-05-]-d, J. Liben-nowell, R. Novak, P. Kumar, A. Raghavan et al., Geographic routing in social networks, Proc. National Academy of Sciences of the USA, pp.11623-11628, 2005.

S. Milgram, The small world problem, Psychology Today, vol.67, issue.1, pp.60-67, 1967.
DOI : 10.1037/e400002009-005

C. Martel and V. Nguyen, Analyzing Kleinberg's (and other) small-world Models, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.179-188, 2004.
DOI : 10.1145/1011767.1011794

M. E. Newman, The Structure and Function of Complex Networks, SIAM Review, vol.45, issue.2, pp.167-256, 2003.
DOI : 10.1137/S003614450342480

N. Sarshar, P. O. Boykin, and V. P. Roychowdhury, Percolation search in power law networks : Making unstructured peer-to-peer networks scalable Decentralized search in networks using homophily and degree disparity, Proc. 4th Int. Conf. on Peer-to-Peer Computing Proc. 19th Int. Joint Conf. on Artificial Intelligence (IJCAI), pp.2-9, 2004.

A. Slivkins, Distance estimation and object location via rings of neighbors, Proceedings of the twenty-fourth annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing , PODC '05, pp.41-50, 2005.
DOI : 10.1145/1073814.1073823