J. Barnes and P. Hut, A hierarchical o(nlogn) force-calculation algorithm, Nature, pp.446-449, 1986.

U. Brandes, Drawing on Physical Analogies, Drawing Graphs, pp.71-86, 2001.
DOI : 10.1007/3-540-44969-8_4

F. Dabek, R. Cox, F. Kaashoek, and R. Morris, Vivaldi: a decentralized network coordinate system, Applications, technologies, architectures, and protocols for computer communications, pp.15-26, 2004.

R. Davidson and D. Harel, Drawing graphs nicely using simulated annealing, ACM Transactions on Graphics, vol.15, issue.4, pp.301-331, 1996.
DOI : 10.1145/234535.234538
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.5663

P. Eades, A heuristic for graph drawing, Congressus Numerantium, pp.149-160, 1984.

T. M. Fruchterman and E. M. Reingold, Graph drawing by force-directed placement, Software-Practice and Experience, pp.1129-1164, 1991.
DOI : 10.1002/spe.4380211102
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8444

. Grouplens, MovieLens Datasets, 2010.

P. Hage and F. Harary, Structural Models in Anthro-pology, 1983.

K. M. Hall, An r-dimensional quadratic placement algorithm, Management Science, pp.219-229, 1970.
DOI : 10.1287/mnsc.17.3.219

F. Heider, Attitudes and cognitive organization, The Journal of Psychology, pp.107-112, 1946.
DOI : 10.1080/00223980.1946.9917275

T. Kamada and S. Kawai, An algorithm for drawing general undirected graphs, Inf. Process. Lett, pp.7-15, 1989.

Y. Koren, L. Carmel, and D. Harel, Ace: a fast multiscale eigenvectors computation for drawing huge graphs, INFOVIS, pp.137-144, 2002.

Y. Koren and A. , The Binary Stress Model for Graph Drawing, Graph Drawing, pp.193-205, 2009.
DOI : 10.1007/978-3-642-00219-9_19

J. Kunegis, S. Schmidt, A. Lommatzsch, J. Lerner, E. W. Luca et al., Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization, SDM, pp.559-570, 2010.
DOI : 10.1137/1.9781611972801.49

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

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

M. E. Newman, Analysis of weighted networks, Physical Review E, vol.70, issue.5, 2004.
DOI : 10.1103/PhysRevE.70.056131

A. Noack, Energy models for drawing clustered small-world graphs, 2003.

A. Noack, Energy Models for Graph Clustering, Journal of Graph Algorithms and Applications, vol.11, issue.2, pp.453-480, 2007.
DOI : 10.7155/jgaa.00154
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.662

K. E. Read, Cultures of the Central Highlands, New Guinea, Southwestern Journal of Anthropology, vol.10, issue.1, 1954.
DOI : 10.1086/soutjanth.10.1.3629074

D. Tunkelang, JIGGLE: Java Interactive Graph Layout Environment, Graph Drawing (GD), pp.413-422, 1998.
DOI : 10.1007/3-540-37623-2_33