P. Mathiaut, M. Lambert, A. Dubois, J. Sicre, R. Brulin et al., Solving the Traffic and Flitter Challenges with Tulip, IEEE Symposium on Visual Analytics Science and Technology, pp.247-248, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00413602

P. Koenig, F. Zaidi, and D. Archambault, Interactive Searching and Visualization of Patterns in Attributed Graphs, Proceedings of Graphics Interface, pp.113-120, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00499430

F. Gilbert, P. Simonetto, F. Zaidi, F. Jourdan, and R. Bourqui, Communities and hierarchical structures in dynamic social networks: analysis and visualization, Social Network Analysis and Mining, vol.393, issue.6, 2010.
DOI : 10.1007/s13278-010-0002-8
URL : https://hal.archives-ouvertes.fr/hal-00520936

F. Zaidi and G. Melançon, Organization of Information for the Web using Hierarchical Fuzzy Clustering Algorithm based on Co-Occurrence Networks, WI-IAT '10: Proceedings of the, ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp.421-424, 2010.

A. Lada and . Adamic, The small world web, Proceedings of the Third European Conference on Research and Advanced Technology for Digital Libraries, pp.443-452, 1999.

W. Aiello, F. Chung, and L. Lu, A Random Graph Model for Power Law Graphs, Experimental Mathematics, vol.2, issue.1, pp.53-66, 2000.
DOI : 10.1016/S0095-8956(81)80021-4

W. Aiello, F. R. Chung, and L. Lu, Random evolution in massive graphs, FOCS, pp.510-519, 2001.

J. Albert and B. , Error and attack tolerance of complex networks, Nature, vol.1696, issue.6794, pp.378-382, 2000.
DOI : 10.1038/35019019

D. Alderson, L. Li, W. Willinger, and J. C. Doyle, Understanding Internet topology: principles, models, and validation, IEEE/ACM Transactions on Networking, vol.13, issue.6, pp.1205-1218, 2005.
DOI : 10.1109/TNET.2005.861250
URL : http://authors.library.caltech.edu/1825/1/ALDieeeacmtn05.pdf

J. Ignacio-alvarez-hamelin, L. Dall-'asta, A. Barrat, and A. Vespignani, k-core decomposition: a tool for the visualization of large scale networks, Advances in Neural Information Processing Systems, pp.41-50, 2006.

L. A. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, Classes of small-world networks, Proceedings of the National Academy of Sciences of the United States of America, pp.11149-11152, 2000.
DOI : 10.1073/pnas.200327197

M. Amiel, G. Melançon, and C. Rozenblat, Réseaux Multi-Niveaux : L'Exemple des Echanges Aériens Mondiaux de Passagers, Mappemonde, p.79, 2005.

D. Auber, Y. Chiricota, F. Jourdan, and G. Melancon, Multiscale visualization of small world networks, IEEE Symposium on Information Visualization 2003 (IEEE Cat. No.03TH8714), pp.75-81, 2003.
DOI : 10.1109/INFVIS.2003.1249011
URL : https://hal.archives-ouvertes.fr/lirmm-00269770

D. Auber, Tulip ??? A Huge Graph Visualization Framework, Graph Drawing Software, Mathematics and Visualization Series, 2003.
DOI : 10.1007/978-3-642-18638-7_5

A. Aula, Enhancing the readability of search result summaries, Proceedings of the HCI 2004: Design for Life, 2004.

G. Bader and C. Hogue, An automated method for finding molecular complexes in large protein interaction networks, BMC Bioinformatics, vol.4, issue.12, 2003.

A. L. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

A. Barrat and M. Weigt, On the properties of small-world network models, The European Physical Journal B, vol.13, issue.3, pp.547-560, 2000.
DOI : 10.1007/s100510050067

V. Batagelj and M. Zaversnik, Generalized cores, 2002.

M. Baur, U. Brandes, M. Gaertler, and D. Wagner, Drawing the AS Graph in 2.5 Dimensions, Proc. Graph Drawing, pp.43-48, 2004.
DOI : 10.1007/978-3-540-31843-9_6

M. Baur and U. Brandes, Multi-circular Layout of Micro/Macro Graphs, Graph Drawing, pp.255-267, 2007.
DOI : 10.1007/978-3-540-77537-9_26

B. Benjamin, B. Bederson, and . Shneiderman, The Craft of Information Visualization: Readings and Reflections (Interactive Technologies), 2003.

S. Bilke and C. Peterson, Topological properties of citation and metabolic networks, Physical Review E, vol.64, issue.3, p.36106, 2001.
DOI : 10.1103/PhysRevE.64.036106

S. Boccaletti, M. Ivanchenko, V. Latora, A. Pluchino, and A. Rapisarda, Detection of complex networks modularity by dynamical clustering, Physical Review E, vol.75, 2007.

B. Bollobás, Mathematical results on scale-free random graphs, Handbook of Graphs and Networks, pp.1-34, 2003.
DOI : 10.1002/3527602755.ch1

M. Erik, . Bollt, and A. Daniel-ben, What is special about diffusion on scale-free nets?, New J. Phys, vol.7, p.26, 2004.

N. Bonnel, V. Lemaire, A. Cotarmanac-'h, and A. Morin, Effective organization and visualization of web search results, Proceedings of the 24th IASTED International Multi-Conference Internet and Multimedia Systems and Applications, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00001157

M. Boulos, The use of interactive graphical maps for browsing medical/health internet information resources, International Journal of Health Geographics, vol.2, issue.11, 2003.

F. Boutin, J. Thievre, and M. Hascoët, Focus-based filtering + clustering technique for power-law networks with small world phenomenon. In VDA'06: Visual Data Analysis -SPIE-IS&T Electronic Imaging, pp.1-012, 2006.
URL : https://hal.archives-ouvertes.fr/lirmm-00128375

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

U. Brandes, A faster algorithm for betweenness centrality*, The Journal of Mathematical Sociology, vol.113, issue.2, pp.163-177, 2001.
DOI : 10.1016/S0378-8733(97)00007-5

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-577, 1973.
DOI : 10.1145/362342.362367

M. Buchanan, Nexus: Small Worlds and the Groundbreaking Theory of Networks, p.124, 2003.

S. Ronald, G. Burt, A. Caldarelli, P. Capocci, M. A. De-los-rios et al., Brokerage and Closure Scale-free networks from varying vertex intrinsic fitness, Phys Rev Lett, issue.25, p.89, 2002.

M. Catanzaro, G. Caldarelli, and L. Pietronero, Assortative model for social networks, Physical Review E, vol.70, issue.3, 2004.
DOI : 10.1103/PhysRevE.70.037101

B. Cheswick, H. Burch, and S. Branigan, Mapping and visualizing the internet, ATEC '00: Proceedings of the annual conference on USENIX Annual Technical Conference, pp.1-1, 2000.

J. S. Coleman, An Introduction to Mathematical Sociology, 1964.

A. Condon and R. M. Karp, Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, pp.116-140, 1999.

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms, McGraw-Hill Science / Engineering / Math, 2003.

D. G. Corneil and C. C. Gotlieb, An Efficient Algorithm for Graph Isomorphism, Journal of the ACM, vol.17, issue.1, pp.51-64, 1970.
DOI : 10.1145/321556.321562

R. Cross, A. Parker, and S. P. Borgatti, A bird's-eye view: Using social network analysis to improve knowledge creation and sharing, Knowledge Directions, vol.2, issue.1, pp.48-61, 2000.

D. De and S. Price, Networks of scientific papers, Science, vol.149, pp.510-515, 1965.

S. Delre, W. Jager, and M. Janssen, Diffusion dynamics in small-world networks with heterogeneous consumers, Computational and Mathematical Organization Theory, vol.61, issue.4, pp.185-202, 2007.
DOI : 10.1007/s10588-006-9007-2

. W. Edsger and . Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.1, pp.269-271, 1959.

C. Discazeaux, C. Rozenblat, P. Koenig, and G. Melançon, Territorial and topological levels in worlwide air transport network, 15TH European Colloquium on Theoretical and Quantitative Geography, 2007.

S. N. Dorogovtsev and J. F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW, 2003.

S. N. Dorogovtsev and J. F. Mendes, Exactly solvable small-world network, Europhysics Letters (EPL), vol.50, issue.1, pp.1-7, 2000.
DOI : 10.1209/epl/i2000-00227-1

H. Ebel, L. Mielsch, and S. Bornholdt, Scale-free topology of e-mail networks, Physical Review E, vol.66, issue.3, p.35103, 2002.
DOI : 10.1103/PhysRevE.66.035103

L. Egghe and R. Rousseau, Introduction to Informetrics, 1990.

J. Ellson, E. Gansner, E. Koutsofios, S. North, and . Graphviz, Avaiable on http

P. Erdös and A. Rényi, On random graphs, i, Publicationes Mathematicae (Debrecen ), vol.6, pp.290-297, 1959.

P. Erdos and A. Renyi, On the evolution of random graphs, Publ. Math. Inst. Hung. Acad. Sci, vol.5, pp.17-61, 1960.

J. Essam, Percolation theory, Reports on Progress in Physics, vol.43, issue.7, p.833, 1980.
DOI : 10.1088/0034-4885/43/7/001

B. S. Everitt, S. Landau, and M. Leese, Cluster Analysis, 2009.
DOI : 10.1002/9780470977811

M. Faloutsos, P. Faloutsos, and C. Faloutsos, On power-law relationships of the internet topology, SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp.251-262, 1999.

R. Ferrer, I. Cancho, and R. V. Solé, The small world of human language, Proc R Soc Lond B Biol Sci, vol.268, pp.2261-2265, 1482.

D. Fisher, Using Egocentric Networks to Understand Communication, IEEE Internet Computing, vol.9, issue.5, pp.20-28, 2005.
DOI : 10.1109/MIC.2005.114

B. Fortuna, D. Mladenic, and M. Grobelnik, Visualization of text document corpus, Informatica Journal, vol.29, issue.4, pp.497-502, 2005.

L. C. Freeman, A Set of Measures of Centrality Based on Betweenness, Sociometry, vol.40, issue.1, pp.35-41, 1977.
DOI : 10.2307/3033543

P. Fu and K. Liao, An Evolving Scale-free Network with Large Clustering Coefficient, 2006 9th International Conference on Control, Automation, Robotics and Vision, pp.1-4, 2006.
DOI : 10.1109/ICARCV.2006.345053

M. Gaertler and M. Patrignani, Dynamic analysis of the autonomous system graph, IPS 2004, International Workshop on Inter-domain Performance and Simulation, pp.13-24, 2004.

J. Galaskiewicz and P. V. Marsden, Interorganizational resource networks: Formal patterns of overlap, Social Science Research, vol.7, issue.2, pp.89-107, 1978.
DOI : 10.1016/0049-089X(78)90006-6

A. Gavin, M. Bosche, R. Krause, P. Grandi, M. Marzioch et al., Functional organization of the yeast proteome by systematic analysis of protein complexes, Nature, vol.415, issue.6868, pp.415141-147, 2002.
DOI : 10.1038/415141a

D. Gibson, R. Kumar, and A. Tomkins, Discovering large dense subgraphs in massive graphs, VLDB '05: Proceedings of the 31st international conference on Very large data bases, pp.721-732, 2005.

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. USA, pp.8271-8276, 2002.
DOI : 10.1073/pnas.122653799

A. D. Gordon, Classification: Methods for the Exploratory Analysis of Multivariate Data, 1981.

M. Granovetter, The Strength of Weak Ties, American Journal of Sociology, vol.78, issue.6, pp.1360-1380, 1973.
DOI : 10.1086/225469

M. Grobelnik and D. Mladenic, Visualization of news articles, Informatica Journal, vol.28, 2004.

J. Guare, Six Degrees of Separation, 1990.
DOI : 10.5040/9781580815154.01

J. Guillaume and M. Latapy, Bipartite graphs as models of complex networks, Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), 2004.

R. Guimera, S. Mossa, A. Turtschi, and L. A. Amaral, The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles, Proceedings of the National Academy of Sciences, vol.102, issue.22, pp.7794-7799, 2005.
DOI : 10.1073/pnas.0407994102

W. Guo and S. B. Kraines, A Random Network Generator with Finely Tunable Clustering Coefficient for Small-World Social Networks, 2009 International Conference on Computational Aspects of Social Networks, pp.10-17, 2009.
DOI : 10.1109/CASoN.2009.13

S. Hachul and M. Jünger, Drawing large graphs with a potential-fieldbased multilevel algorithm. Graph Drawing, pp.285-295, 2005.

M. Halkidi, Y. Batistakis, and M. Vazirgiannis, Cluster validity methods, ACM SIGMOD Record, vol.31, issue.2, p.31, 2002.
DOI : 10.1145/565117.565124

M. Halkidi and M. Vazirgiannis, Clustering validity assessment: finding the optimal partitioning of a data set, Proceedings 2001 IEEE International Conference on Data Mining, 2001.
DOI : 10.1109/ICDM.2001.989517

P. Hansen and B. Jaumard, Cluster analysis and mathematical programming, Mathematical Programming, vol.15, issue.2, pp.191-215, 1997.
DOI : 10.1007/BF02614317

J. Heer and D. Boyd, Vizster: Visualizing online social networks, INFOVIS '05: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization, p.5, 2005.
DOI : 10.1109/infvis.2005.1532126

I. Herman, G. Melançon, and M. S. Marshall, Graph visualization and navigation in information visualization: A survey, IEEE Transactions on Visualization and Computer Graphics, vol.6, issue.1, pp.24-43, 2000.
DOI : 10.1109/2945.841119

P. Holme and B. Kim, Growing scale-free networks with tunable clustering, Physical Review E, vol.65, issue.2, p.26107, 2002.
DOI : 10.1103/PhysRevE.65.026107
URL : http://arxiv.org/abs/cond-mat/0110452

H. Hu, X. Yan, Y. Huang, J. Han, and X. J. Zhou, Mining coherent dense subgraphs across massive biological networks for functional discovery, Bioinformatics, vol.21, issue.Suppl 1, pp.213-221, 2005.
DOI : 10.1093/bioinformatics/bti1049

B. A. Huberman, The Laws of the Web, 2001.

P. Jaccard, Bulletin del la société vaudoisedes, Sciences Naturelles, vol.37, pp.241-272, 1901.

R. H. Jackson, The rich get richer Article originally appeared at 84, New Republic, vol.68, 1935.

A. K. Jain, M. N. Murty, and P. J. Flynn, Data clustering: a review, ACM Computing Surveys, vol.31, issue.3, pp.264-323, 1999.
DOI : 10.1145/331499.331504

M. Jamali and H. Abolhassani, Different Aspects of Social Network Analysis, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06), pp.66-72, 2006.
DOI : 10.1109/WI.2006.61

S. Janson, D. E. Knuth, T. Luczak, and B. Pittel, The birth of the giant component, Random Structures and Algorithms, vol.7, issue.3
DOI : 10.1002/rsa.3240040303

H. Jeong, B. Tomber, R. Albert, Z. N. Oltvai, and A. Barabási, The large-scale organization of metabolic networks, Nature, vol.407, pp.651-654, 2000.

Y. Jia, J. Hoberock, M. Garland, and J. Hart, On the visualization of social and other scale-free networks, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.6, pp.1285-1292, 2008.

C. J. Jung, Psychologischen Typen, 1921.

V. K. Kalapala, V. Sanwalani, and C. Moore, The structure of the united states road network, 2003.

R. Kannan, S. Vempala, and A. Vetta, On clusterings-good, bad and spectral, Proceedings 41st Annual Symposium on Foundations of Computer Science, pp.497-515, 2004.
DOI : 10.1109/SFCS.2000.892125
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.8204

A. Daniel and . Keim, Information visualization and visual data mining, IEEETVCG: IEEE Transactions on Visualization and Computer Graphics, vol.8, issue.1, pp.1-8, 2002.

M. D. Kickmeier and D. Albert, The effects of scanability on information search: An online experiment, Proc. Volume 2 of the HCI 2003: Designing for Society, pp.33-36, 2003.

A. Kirman, The economy as an evolving network, Journal of Evolutionary Economics, vol.7, issue.4, pp.339-353, 1997.
DOI : 10.1007/s001910050047

J. S. Kleinfeld, Could it be a big world after all ? Society, pp.61-66, 2002.

K. Klemm and V. M. Eguiluz, Growing scale-free networks with small-world behavior, Physical Review E, vol.65, issue.5, p.57102, 2002.
DOI : 10.1103/PhysRevE.65.057102

E. Donald and . Knuth, The Stanford GraphBase: a platform for combinatorial computing, 1993.

D. Krackhardt, The strength of strong ties: the importance of philos in networks and organization, 1992.

V. Lacroix, C. G. Fernandes, and M. Sagot, Motif Search in Graphs: Application to Metabolic Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.3, issue.4, pp.360-368, 2006.
DOI : 10.1109/TCBB.2006.55
URL : https://hal.archives-ouvertes.fr/hal-00427984

V. Latora and M. Marchiori, Is the boston subway a small-world network? Physica A, pp.109-113, 2002.

A. Leuski and J. Allan, Lighthouse: showing the way to relevant information, IEEE Symposium on Information Visualization 2000. INFOVIS 2000. Proceedings, pp.125-129, 2000.
DOI : 10.1109/INFVIS.2000.885099

L. Li, D. Alderson, J. C. Doyle, and W. Willinger, Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications, Internet Mathematics, vol.2, issue.4, 2005.
DOI : 10.1080/15427951.2005.10129111

L. Li, D. Alderson, W. Willinger, and J. Doyle, A first-principles approach to understanding the internet's router-level topology, SIGCOMM, pp.3-14, 2004.

F. Lilijeros, C. Edling, L. Amaral, E. Stanley, and Y. Yvonneåberg, The web of human sexual contacts Multistage random growing small-world networks with power-law degree distribution, Nature Chinese Phys. Lett, vol.411109, issue.233, pp.907-908, 2001.

U. Luxburg, A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, pp.395-416, 2007.
DOI : 10.1007/s11222-007-9033-z

O. Maimon and L. Rokach, Data Mining and Knowledge Discovery Handbook, 2005.

N. Mathias and V. Gopal, Small worlds: How and why, Physical Review E, vol.63, issue.2, 2001.
DOI : 10.1103/PhysRevE.63.021117

G. Melançon, Just how dense are dense graphs in the real world?, Proceedings of the 2006 AVI workshop on BEyond time and errors novel evaluation methods for information visualization, BELIV '06, pp.1-7, 2006.
DOI : 10.1145/1168149.1168167

G. Melançon and A. Sallaberry, Edge Metrics for Visual Graph Analytics: A Comparative Study, 2008 12th International Conference Information Visualisation, pp.610-615, 2008.
DOI : 10.1109/IV.2008.10

R. K. Merton, The Matthew Effect in Science: The reward and communication systems of science are considered, Science, vol.159, issue.3810, pp.56-63, 1968.
DOI : 10.1126/science.159.3810.56

M. Mihail, C. Gkantsidis, A. Saberi, and E. Zegura, On the semantics of internet topologies, tech. rep. gitcc0207, 2002.

B. S. Miitchell, S. Mancoridis, C. Yih-farn, and G. E. Bunch, A clustering tool for the recovery and maintenance of software system structures, International Conference on Software Maintenance, ICSM, 1999.

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

G. W. Milligan, A monte-carlo study of 30 internal criterion measures for clusteranalysis . Psychometrica, pp.187-195, 1981.

M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures & Algorithms, vol.3, issue.2-3, pp.161-180, 1995.
DOI : 10.1002/rsa.3240060204

J. M. Montoya and R. V. Solé, Small World Patterns in Food Webs, Journal of Theoretical Biology, vol.214, issue.3, pp.405-412, 2002.
DOI : 10.1006/jtbi.2001.2460

C. Moore and M. E. Newman, Epidemics and percolation in small-world networks, Physical Review E, vol.61, issue.5, pp.5678-5682, 1999.
DOI : 10.1103/PhysRevE.61.5678

J. Nesetril and S. Poljak, On the complexity of the subgraph problem, Comment. Math. Univ. Carolinae, vol.26, pp.415-419, 1985.

K. A. Neuendorf, The Content Analysis Guidebook, 2001.

M. E. Newman, Scientific collaboration networks.??????I. Network construction and fundamental results, Physical Review E, vol.64, issue.1, 2001.
DOI : 10.1103/PhysRevE.64.016131

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.69, issue.2, 2004.
DOI : 10.1103/PhysRevE.69.026113

M. E. Newman, Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality, Physical Review E, vol.64, issue.1, p.16132, 2001.
DOI : 10.1103/PhysRevE.64.016132

M. E. Newman, Assortative Mixing in Networks, Physical Review Letters, vol.89, issue.20, pp.89-109, 2002.
DOI : 10.1103/PhysRevLett.89.208701

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

M. E. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, vol.69, issue.6, p.66133, 2004.
DOI : 10.1103/PhysRevE.69.066133

M. E. Newman, Finding community structure in networks using the eigenvectors of matrices, Physical Review E, vol.74, issue.3, 2006.
DOI : 10.1103/PhysRevE.74.036104

M. E. Newman, D. J. Watts, and S. H. Strogatz, Random graph models of social networks, Proceedings of the National Academy of Sciences of the United States of America, pp.2566-2572, 2002.
DOI : 10.1073/pnas.012582999

M. J. Newman, A. Barabási, and D. J. Watts, The Structure and Dynamics of Networks: (Princeton Studies in Complexity), 2006.

H. Quynh, . Nguyen, V. J. Rayward, and . Smith, Internal quality measures for clustering in metric spaces, International Journal Business Intelligence and Data Mining, vol.3, issue.1, pp.4-29, 2008.

T. N. Nguyen and J. Zhang, A novel visualization model for web search results. Visualization and Computer Graphics, IEEE Transactions on, vol.12, issue.5, pp.981-988, 2006.

N. Päivinen, Clustering with a minimum spanning tree of scale-free-like structure, Pattern Recognition Letters, vol.26, issue.7, pp.921-930, 2005.
DOI : 10.1016/j.patrec.2004.09.039

R. Pastor-satorras and A. Vespignani, Epidemic Spreading in Scale-Free Networks, Physical Review Letters, vol.86, issue.14, pp.3200-3203, 2001.
DOI : 10.1103/PhysRevLett.86.3200

D. De and S. Price, A general theory of bibliometric and other cumulative advantage processes, Journal of the American Society for Information Science, pp.292-306, 1976.

F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi, Defining and identifying communities in networks, Proceedings of the National Acadademy of Science USA, pp.2658-2663, 2004.
DOI : 10.1073/pnas.0400054101

M. William and . Rand, Objective criteria for the evaluation of clustering methods, Journal of the American Statistical Association, vol.66, issue.336, pp.846-850, 1971.

A. Rapoport, Contribution to the theory of random and biased nets, The Bulletin of Mathematical Biophysics, vol.1, issue.4, pp.257-277, 1957.
DOI : 10.1007/BF02478417

A. Rapoport and W. J. Horvath, A study of a large sociogram, Behavioral Science, vol.13, issue.4, pp.279-291, 1961.
DOI : 10.1002/bs.3830060402

A. Reka and . Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys, vol.74, pp.47-97, 2002.

C. Rozenblat, G. Melançon, and P. Koenig, Continental integration in multilevel approach of world air transportation Networks and Spatial Economics, 2000.

A. Sallaberry, F. Zaidi, C. Pich, G. Melañ, and A. §on, Interactive visualization and navigation of web search results revealing community structures and bridges, Proceedings of Graphics Interface, pp.105-112, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00538564

G. Salton and C. Buckley, Term-weighting approaches in automatic text retrieval. Information Processing and Management, pp.513-523, 1988.

E. Satu and . Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.

J. P. Scott, Social Network Analysis: A Handbook, Manna. Small-world properties of the indian railway network, 2000.
DOI : 10.4135/9781446294413

G. Simmel and K. H. Wolff, The sociology of Georg Simmel / translated and edited with an introduction by, 1950.

A. Herbert and . Simon, On a class of skew distribution functions, Biometrika, vol.424, issue.3, pp.425-440, 1955.

A. Daniel, S. Spielman, and . Teng, Spectral partitioning works: Planar graphs and finite element meshes, IEEE Symposium on Foundations of Computer Science, pp.96-105, 1996.

M. Steinbach, G. Karypis, and V. Kumar, A comparison of document clustering techniques, 2000.

R. Tanaka, Scale-Rich Metabolic Networks, Physical Review Letters, vol.94, issue.16, p.168101, 2005.
DOI : 10.1103/PhysRevLett.94.168101

V. Thai, S. Handschuh, and S. Decker, IVEA: An Information Visualization Tool for Personalized Exploratory Document Collection Analysis, Proceedings of the 5th European Semantic Web Conference, 2008.
DOI : 10.1007/978-3-540-68234-9_13

J. James, K. A. Thomas, and . Cook, Illuminating the Path: The Research and Development Agenda for Visual Analytics. National Visualization and Analytics Ctr, 2005.

G. Ioannis, G. D. Tollis, P. Battista, R. Eades, and . Tamassia, Graph Drawing: Algorithms for the Visualization of Graphs, 1999.

J. Travers and S. Milgram, An Experimental Study of the Small World Problem, Sociometry, vol.32, issue.4, pp.425-443, 1969.
DOI : 10.2307/2786545

R. C. Tryon, Cluster analysis, 1939.

S. Valverde, R. F. Cancho, and R. V. Solé, Scale-free networks from optimal design, Europhysics Letters (EPL), vol.60, issue.4, pp.512-517, 2002.
DOI : 10.1209/epl/i2002-00248-2
URL : http://arxiv.org/abs/cond-mat/0204344

F. Van-ham and J. J. Van-wijk, Interactive Visualization of Small World Graphs, IEEE Symposium on Information Visualization, pp.199-206, 2004.
DOI : 10.1109/INFVIS.2004.43

W. M. Vancleemput and J. G. Linders, An improved graph-theoretic model for the circuit layout problem, DAC '74: Proceedings of the 11th Design Automation Workshop, pp.82-90, 1974.

S. Virtanen, Properties of nonuniform random graph models, Research Report, vol.77, 2003.

A. Wagner and D. Fell, The small world inside large metabolic networks, Proceedings of the Royal Society B: Biological Sciences, vol.268, issue.1478, 2000.
DOI : 10.1098/rspb.2001.1711

J. Wang and L. Rong, Evolving Small-World Networks based on the Modified BA Model, 2008 International Conference on Computer Science and Information Technology, pp.143-146, 2008.
DOI : 10.1109/ICCSIT.2008.119

L. Wang, F. Du, H. P. Dai, and Y. X. Sun, Random pseudofractal scale-free networks with small-world effect, The European Physical Journal B, vol.85, issue.3, pp.361-366, 2006.
DOI : 10.1140/epjb/e2006-00389-0

F. Xiao, G. Wang, and . Chen, Complex networks: small-world, scale-free and beyond. Circuits and Systems Magazine, IEEE, vol.3, issue.1, pp.6-20, 2003.

S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, 1994.
DOI : 10.1017/CBO9780511815478

D. J. Watts and S. H. Strogatz, Collective dynamics of 'small-world' networks, Nature, vol.393, issue.6684, pp.440-442, 1998.
DOI : 10.1038/30918

D. J. Watts, Six Degrees: The Science of a Connected Age, W. W. Norton & Company, 2003.

C. Weare and W. Lin, Content Analysis of the World Wide Web: Opportunities and Challenges, Social Science Computer Review, vol.18, issue.3, pp.272-292, 2000.
DOI : 10.1177/089443930001800304

B. Wellman, For a social network analysis of computer networks, Proceedings of the 1996 ACM SIGCPR/SIGMIS conference on Computer personnel research , SIGCPR '96, pp.1-11, 1996.
DOI : 10.1145/238857.238860

J. G. White, E. Southgate, J. N. Thompson, and S. Brenner, The Structure of the Nervous System of the Nematode Caenorhabditis elegans, Philosophical Transactions of the Royal Society B: Biological Sciences, vol.314, issue.1165, pp.1-340, 1986.
DOI : 10.1098/rstb.1986.0056

R. J. Williams and N. D. Martinez, Simple rules yield complex food webs, Nature, vol.81, issue.6774, pp.180-183, 2000.
DOI : 10.1038/35004572

Y. Andrew, M. Wu, J. Garland, and . Han, Mining scale-free networks using geodesic clustering, KDD '04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.719-724, 2004.

Y. Wu, L. Shankar, and X. Chen, Finding more useful information faster from web search results, Proceedings of the twelfth international conference on Information and knowledge management , CIKM '03, pp.568-571, 2003.
DOI : 10.1145/956863.956975

S. Wuchty and E. Almaas, Peeling the yeast protein network, PROTEOMICS, vol.406, issue.2, pp.444-449, 2005.
DOI : 10.1002/pmic.200400962

R. Xu and D. Wunsch, Survey of Clustering Algorithms, IEEE Transactions on Neural Networks, vol.16, issue.3, pp.645-678, 2005.
DOI : 10.1109/TNN.2005.845141

E. Yoneki, P. Hui, and J. Crowcroft, Wireless Epidemic Spread in Dynamic Human Networks, Lecture Notes in Computer Science, vol.6, issue.7043, pp.116-132, 2007.
DOI : 10.1287/mnsc.6.3.324

I. Yoo and X. Hu, A comprehensive comparison study of document clustering for a biomedical digital library MEDLINE, Proceedings of the 6th ACM/IEEE-CS joint conference on Digital libraries , JCDL '06, pp.220-229, 2006.
DOI : 10.1145/1141753.1141802

G. Udny and Y. , A mathematical theory of evolution, based on the conclusions of dr. j. c. willis, f.r.s, Philosophical Transactions of the Royal Society of London, Ser. B, issue.213, pp.21-87, 1925.

W. W. Zachary, An Information Flow Model for Conflict and Fission in Small Groups, Journal of Anthropological Research, vol.33, issue.4, pp.452-473, 1977.
DOI : 10.1086/jar.33.4.3629752

H. Zeng, Q. He, Z. Chen, W. Ma, and J. Ma, Learning to cluster web search results, Proceedings of the 27th annual international conference on Research and development in information retrieval , SIGIR '04, pp.210-217, 2004.
DOI : 10.1145/1008992.1009030

H. Zhang, A. Goel, and R. Govindan, Using the small-world model to improve Freenet performance, Computer Networks, vol.46, issue.4, pp.555-574, 1999.
DOI : 10.1016/j.comnet.2004.05.004