E. H. Aarts and . Laarhoven, Statistical cooling : A general approach to combinatorial optimization problems, Philips J. Res, vol.40, issue.4, pp.193-226, 1985.

J. Abello, F. Van-ham, and N. Krishnan, ASK-GraphView: A Large Scale Graph Visualization System, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.669-676, 2006.
DOI : 10.1109/TVCG.2006.120

Y. Y. Ahn, J. P. Bagrow, and S. Lehmann, Link communities reveal multiscale complexity in networks, Nature, vol.80, issue.7307, pp.761-764, 2010.
DOI : 10.1038/nature09182

H. Akima, A Method of Bivariate Interpolation and Smooth Surface Fitting for Irregularly Distributed Data Points, ACM Transactions on Mathematical Software, vol.4, issue.2, pp.148-159, 1978.
DOI : 10.1145/355780.355786

R. Albert and A. L. Barabási, Statistical mechanics of complex networks, Reviews of Modern Physics, vol.74, issue.1, pp.47-97, 2002.
DOI : 10.1103/RevModPhys.74.47

R. Aldecoa and I. Marín, Deciphering Network Community Structure by Surprise, PLoS ONE, vol.36, issue.9, p.24195, 2011.
DOI : 10.1371/journal.pone.0024195.s008

A. Almudevar and C. Field, Estimation of Single-Generation Sibling Relationships Based on DNA Markers, Journal of Agricultural, Biological, and Environmental Statistics, vol.4, issue.2, pp.136-165, 1999.
DOI : 10.2307/1400594

B. Alper, N. Riche, G. Ramos, and M. Czerwinski, Design study of linesets, a novel set visualization technique. Visualization and Computer Graphics, IEEE Transactions on, vol.17, issue.12, pp.2259-2267, 2011.

J. , I. Alvarez-hamelin, L. Dall-'asta, A. Barrat, and A. Vespignani, K-core decomposition of internet graphs : hierarchies, self-similarity and measurement biases. Networks and Heterogeneous Media, pp.371-293, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00012974

S. Amster, Beyond ANOVA, Basics of Applied Statistics, Technometrics, vol.29, issue.3, pp.387-387, 1987.
DOI : 10.1080/00401706.1987.10488261

K. Andreev and H. Racke, Balanced graph partitioning. Theory of Computing Systems, pp.929-939, 2006.

D. Archambault, T. Munzner, and D. Auber, Topolayout : Multilevel graph layout by topological features. Visualization and Computer Graphics, IEEE Transactions on, vol.13, issue.2, pp.305-317, 2007.
DOI : 10.1109/tvcg.2007.46
URL : https://hal.archives-ouvertes.fr/hal-00306601

A. Arenas, A. Fernandez, and S. Gomez, Analysis of the structure of complex networks at different resolution levels, New Journal of Physics, vol.10, issue.5, p.53039, 2008.
DOI : 10.1088/1367-2630/10/5/053039

D. Auber, Y. Chiricota, G. Melancon, and F. Jourdan, Multiscale navigation of small world networks, IEEE Symposium on Information Visualisation, pp.75-81, 2003.

D. Auber, D. Archambault, R. Bourqui, A. Lambert, M. Mathiaut et al., The Tulip 3 Framework : A Scalable Software Library for Information Visualization Applications Based on Relational Data, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00659880

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

M. Barthélemy, Spatial networks, Physics Reports, vol.499, issue.1-3, pp.1-101, 2011.
DOI : 10.1016/j.physrep.2010.11.002

M. Batty, Hierarchy in Cities and City Systems, Hierarchy in natural and social sciences, pp.143-168, 2006.
DOI : 10.1007/1-4020-4127-6_7

R. Bauer, M. Krug, and D. Wagner, Enumerating and generating labeled kdegenerate graphs, 7th Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp.90-98, 2010.
DOI : 10.1137/1.9781611973006.12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.5860

C. Biemann, Chinese whispers, Proceedings of TextGraphs: the First Workshop on Graph Based Methods for Natural Language Processing on the First Workshop on Graph Based Methods for Natural Language Processing, TextGraphs '06, pp.73-80
DOI : 10.3115/1654758.1654774

P. Bille, A survey on tree edit distance and related problems. Theoretical computer science, pp.217-239, 2005.

J. Blitzstein and P. Diaconis, A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees, Internet Mathematics, vol.6, issue.4, pp.489-522, 2010.
DOI : 10.1080/15427951.2010.557277

D. Vincent, J. Blondel, R. Guillaume, E. Lambiotte, and . Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics : Theory and Experiment, issue.10, p.10008, 2008.

R. Bourqui, Décomposition et Visualisation de graphes : Applications aux Données Biologiques. These, Université Sciences et Technologies -Bordeaux I, 2008.

F. Boutin and M. Hascoët, Cluster validity indices for graph partitioning, Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004., pp.376-381, 2004.
DOI : 10.1109/IV.2004.1320171
URL : https://hal.archives-ouvertes.fr/lirmm-00108948

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

U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer et al., On modularity clustering. Knowledge and Data Engineering, IEEE Transactions on, vol.20, issue.2, pp.172-188, 2008.

R. Burkard, M. Dell-'amico, and S. Martello, Assignment problems, 2012.

S. Chandra, . Chekuri, V. Andrew, . Goldberg, R. David et al., Experimental study of minimum cut algorithms, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, pp.324-333

M. Chimani, C. Gutwenger, M. Jünger, K. Klein, P. Mutzel et al., The open graph drawing framework, 15th International Symposium on Graph Drawing, pp.23-26, 2007.

A. Clauset, C. Moore, and M. E. Newman, Structural Inference of Hierarchies in Networks, Proceedings of the 2006 conference on Statistical network analysis, pp.1-13, 2006.
DOI : 10.1007/978-3-540-73133-7_1

A. Clauset, C. Moore, and M. E. Newman, Hierarchical structure and the prediction of missing links in networks, Nature, vol.104, issue.7191, pp.45398-101, 2008.
DOI : 10.1038/nature06830

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, Physical Review E, vol.70, issue.6, p.66111, 2004.
DOI : 10.1103/PhysRevE.70.066111

C. Collins, G. Penn, and S. Carpendale, Bubble sets : Revealing set relations with isocontours over existing visualizations. Visualization and Computer Graphics, IEEE Transactions on, vol.15, issue.6, pp.1009-1016, 2009.
DOI : 10.1109/tvcg.2009.122
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.3671

A. Stephen and . Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, pp.151-158, 1971.

M. Coscia, G. Rossetti, F. Giannotti, and D. Pedreschi, DEMON, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '12, pp.615-623, 2012.
DOI : 10.1145/2339530.2339630

A. Michael, . Cox, F. Trevor, and . Cox, Multidimensional scaling, Handbook of data visualization, pp.315-347, 2008.

J. J. Daudin, F. Picard, and S. Robin, A mixture model for random graphs, Statistics and Computing, vol.4, issue.2, pp.173-183, 2008.
DOI : 10.1007/s11222-007-9046-7
URL : https://hal.archives-ouvertes.fr/inria-00070186

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

J. De, L. Rivas, and C. Fontanillo, Protein?protein interactions essentials : key concepts to building and analyzing interactome networks, PLoS computational biology, vol.6, issue.6, p.1000807, 2010.

A. De-montis, S. Caschili, and A. Chessa, Commuter networks and community detection: A method for planning sub regional areas, The European Physical Journal Special Topics, vol.66, issue.1, 2011.
DOI : 10.1140/epjst/e2013-01716-4

M. Delest and J. Fédou, Attribute grammars are useful for combinatorics, Theoretical Computer Science, vol.98, issue.1, pp.65-76, 1992.
DOI : 10.1016/0304-3975(92)90380-X

L. Donetti, A. Miguel, and . Munoz, Detecting network communities: a new systematic and efficient algorithm, Journal of Statistical Mechanics: Theory and Experiment, vol.2004, issue.10, p.10012, 2004.
DOI : 10.1088/1742-5468/2004/10/P10012

S. Selan-dos and K. Brodlie, Gaining understanding of multivariate and multidimensional data through visualization, Computers & Graphics, vol.28, issue.3, pp.311-325, 2004.

T. Dwyer, K. Marriott, F. Schreiber, P. Stuckey, M. Woodward et al., Exploration of Networks using overview+detail with Constraint-based cooperative layout, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.6, pp.1293-1300, 2008.
DOI : 10.1109/TVCG.2008.130

P. Eades and Q. Feng, Multilevel visualization of clustered graphs, Graph Drawing, pp.101-112, 1996.
DOI : 10.1007/3-540-62495-3_41

P. Eades and M. L. Huang, Navigating Clustered Graphs Using Force-Directed Methods, Journal of Graph Algorithms and Applications, vol.4, issue.3, pp.157-181, 2000.
DOI : 10.7155/jgaa.00029

P. Erd?-os and A. Rényi, On random graphs i, Publ. Math. Debrecen, vol.6, pp.290-297, 1959.

L. Euler, Solutio problematis ad geometriam situs pertinentis. Commentarii academiae scientiarum Petropolitanae, pp.128-140

K. Fischer, B. Gärtner, and M. Kutz, Fast Smallest-Enclosing-Ball Computation in High Dimensions, Algorithms, pp.630-641, 2003.
DOI : 10.1007/978-3-540-39658-1_57

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

M. Merrill and . Flood, The traveling-salesman problem, Operations Research, vol.4, issue.1, pp.61-75, 1956.

M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, A. Leighton et al., Drawing graphs in the plane with high resolution

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, pp.75-174, 2010.
DOI : 10.1016/j.physrep.2009.11.002

S. Fortunato and M. Barthelemy, Resolution limit in community detection, Proceedings of the National Academy of Sciences, vol.104, issue.1, pp.36-41, 2007.
DOI : 10.1073/pnas.0605965104

S. Fortunato, V. Latora, and M. Marchiori, Method to find community structures based on information centrality, Physical Review E, vol.70, issue.5, p.56104, 2004.
DOI : 10.1103/PhysRevE.70.056104

C. Linton and . Freeman, A set of measures of centrality based on betweenness, Sociometry, pp.35-41, 1977.

A. Frick, A. Ludwig, and H. Mehldau, A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration), Graph Drawing, pp.388-403, 1995.
DOI : 10.1007/3-540-58950-3_393

J. Gantz and D. Reinsel, Extracting value from chaos, IDC iView, pp.1-12, 2011.

F. Gargiulo, M. Lenormand, S. Huet, and O. B. Espinosa, A commuting network model : going to the bulk Arxiv preprint arXiv :1102, 2011.

B. Gaume, F. Venant, and B. Victorri, Hierarchy in lexical organization of natural language, Hierarchy in natural and social sciences

M. Ghoniem, J. Fekete, and P. Castagliola, On the Readability of Graphs Using Node-Link and Matrix-Based Representations: A Controlled Experiment and Statistical Analysis, Information Visualization, vol.1, issue.2, pp.114-135, 2005.
DOI : 10.1057/palgrave.ivs.9500092
URL : https://hal.archives-ouvertes.fr/hal-00340790

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy of Sciences, p.7821, 2002.
DOI : 10.1073/pnas.122653799

M. Girvan and M. E. Newman, Community structure in social and biological networks, Proceedings of the National Academy Science USA, pp.7821-7826, 2002.
DOI : 10.1073/pnas.122653799

A. Goder and V. Filkov, Consensus Clustering Algorithms: Comparison and Refinement, ALENEX, pp.109-117, 2008.
DOI : 10.1137/1.9781611972887.11

B. H. Good, Y. A. De-montjoye, and A. Clauset, Performance of modularity maximization in practical contexts, Physical Review E, vol.81, issue.4, p.46106, 2010.
DOI : 10.1103/PhysRevE.81.046106

R. Guimera, M. Sales-pardo, and L. Amaral, Modularity from fluctuations in random graphs and complex networks, Physical Review E, vol.70, issue.2, p.25101, 2004.
DOI : 10.1103/PhysRevE.70.025101

D. Gusfield, Partition-distance: A problem and class of perfect graphs arising in clustering, Information Processing Letters, vol.82, issue.3, pp.159-164, 2002.
DOI : 10.1016/S0020-0190(01)00263-0

S. Hachul and M. Jünger, Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm, Graph Drawing, pp.285-295, 2005.
DOI : 10.1007/978-3-540-31843-9_29

L. Hamers, Y. Hemeryck, G. Herweyers, M. Janssen, H. Keters et al., Similarity measures in scientometric research: The Jaccard index versus Salton's cosine formula, Information Processing & Management, vol.25, issue.3, pp.315-318, 1989.
DOI : 10.1016/0306-4573(89)90048-4

J. Jing-dong, N. Han, T. Bertin, . Hao, S. Debra et al., Evidence for dynamically organized modularity in the yeast protein? protein interaction network, Nature, issue.6995, pp.43088-93, 2004.

J. Heer and D. Boyd, Vizster : visualizing online social networks, Information Visualization, 2005. INFOVIS 2005. IEEE Symposium on, pp.32-39
DOI : 10.1109/infvis.2005.1532126

P. Jaccard, Bulletin de la société vaudoise des sciences naturelles Distribution de la flore alpine dans le bassin des Dranses et dans quelques régions voisines, pp.241-272, 1901.

R. David and . Karger, Global min-cuts in rnc, and other ramifications of a simple min-out algorithm, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, pp.21-30, 1993.

B. Karrer, E. Levina, and M. E. Newman, Robustness of community structure in networks, Physical Review E, vol.77, issue.4, p.46119, 2008.
DOI : 10.1103/PhysRevE.77.046119

G. Karypis and V. Kumar, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1998.
DOI : 10.1137/S1064827595287997

J. Katriel, On a generalized recurrence for bell numbers, Journal of Integer Sequences, vol.11, issue.2, p.3, 2008.

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

C. Kosak, J. Marks, and S. M. Shieber, A parallel genetic algorithm for network-diagram layout, ICGA, pp.458-465, 1991.

A. Kraskov, H. Stögbauer, G. Ralph, P. Andrzejak, and . Grassberger, Hierarchical clustering using mutual information, Europhysics Letters (EPL), vol.70, issue.2, pp.278-284, 2005.
DOI : 10.1209/epl/i2004-10483-y
URL : http://arxiv.org/abs/q-bio/0311037

M. Kubale, Graph colorings, 2004.
DOI : 10.1090/conm/352

W. Harold and . Kuhn, The hungarian method for the assignment problem, Naval research logistics quarterly, vol.2, issue.12, pp.83-97, 1955.

P. Kuntz, D. Snyers, and P. J. Layzell, A stochastic heuristic for visualising graph clusters in a bi-dimensional space prior to partitioning, Journal of Heuristics, vol.5, issue.3, pp.327-351, 1999.
DOI : 10.1023/A:1009665701840

A. Lambert, R. Bourqui, and D. Auber, Winding Roads: Routing edges into bundles, Computer Graphics Forum, vol.31, issue.2, pp.853-862, 2010.
DOI : 10.1111/j.1467-8659.2009.01700.x
URL : https://hal.archives-ouvertes.fr/hal-00495279

A. Lambert, F. Queyroi, and R. Bourqui, Visualizing Patterns in Node-link Diagrams, 2012 16th International Conference on Information Visualisation, pp.48-53, 2012.
DOI : 10.1109/IV.2012.19
URL : https://hal.archives-ouvertes.fr/hal-00744965

A. Lancichinetti, Community detection algorithms: A comparative analysis, Physical Review E, vol.80, issue.5, p.56117, 2009.
DOI : 10.1103/PhysRevE.80.056117

A. Lancichinetti and S. Fortunato, Limits of modularity maximization in community detection Arxiv preprint, 2011.

A. Lancichinetti and F. Radicchi, Benchmark graphs for testing community detection algorithms, Physical Review E, vol.78, issue.4, p.46110, 2008.
DOI : 10.1103/PhysRevE.78.046110
URL : http://arxiv.org/abs/0805.4770

A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato, Finding Statistically Significant Communities in Networks, PLoS ONE, vol.81, issue.4, p.18961, 2011.
DOI : 10.1371/journal.pone.0018961.s001

T. Laurent and N. Villa-vialaneix, Using spatial indexes for labeled network analysis. Information-Interaction-Intelligence, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00654754

J. Lee, A. Lendasse, and M. Verleysen, Curvilinear distance analysis versus isomap, Proceedings of ESANN, pp.185-192, 2002.

X. Ian, P. Leung, P. Hui, and J. Crowcroft, Towards real-time community detection in large networks, Physical Review E, vol.79, issue.6, p.66107, 2009.

S. Mancoridis, S. Brian, C. Mitchell, . Rorres, . Chen et al., Using automatic clustering to produce high-level system organizations of source code, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242), pp.45-52, 1998.
DOI : 10.1109/WPC.1998.693283

D. Christopher, P. Manning, H. Raghavan, and . Schütze, Introduction to information retrieval, 2008.

C. Mcgrath, J. Blythe, and D. Krackhardt, Seeing groups in graph layouts, Connections, vol.19, issue.2, pp.22-29, 1996.

M. Ruth, O. J. Mickey, V. Dunn, and . Clark, Applied statistics : analysis of variance and regression, 2004.

M. Mishna, Attribute grammars and automatic complexity analysis, Advances in Applied Mathematics, vol.30, issue.1-2, pp.189-207, 2003.
DOI : 10.1016/S0196-8858(02)00542-0
URL : https://hal.archives-ouvertes.fr/inria-00072620

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

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, Modularity and community structure in networks, Proceedings of the National Academy of Sciences, pp.8577-8582, 2006.
DOI : 10.1073/pnas.0601602103

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

A. Noack, Modularity clustering is force-directed layout, Physical Review E, vol.79, issue.2, p.26102, 2009.
DOI : 10.1103/PhysRevE.79.026102
URL : http://arxiv.org/abs/0807.4052

A. Noack, An Energy Model for Visual Graph Clustering, Proceedings of the 11th International Symposium on Graph Drawing, pp.425-436, 2004.
DOI : 10.1007/978-3-540-24595-7_40

G. Palla, I. Derényi, I. Farkas, and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature, vol.387, issue.7043, pp.435814-818, 2005.
DOI : 10.1038/nature03248

S. Papadopoulos, Y. Kompatsiaris, A. Vakali, and P. Spyridonos, Community detection in Social Media, Data Mining and Knowledge Discovery, vol.21, issue.3, pp.515-554, 2012.
DOI : 10.1007/s10618-011-0224-z

R. Patuelli, A. Reggiani, S. P. Gorman, P. Nijkamp, and F. J. Bade, Network Analysis of Commuting Flows: A Comparative Static Approach to German Data, Networks and Spatial Economics, vol.37, issue.4, pp.315-331, 2007.
DOI : 10.1007/s11067-007-9027-6

R. Perline, Strong, Weak and False Inverse Power Laws, Statistical Science, vol.20, issue.1, pp.68-88, 2005.
DOI : 10.1214/088342304000000215
URL : http://projecteuclid.org/download/pdfview_1/euclid.ss/1118065043

G. Pflieger and C. Rozenblat, Discovery and evaluation of graph-based hierarchical conceptual clusters Urban Studies (Special Issue : Urban Networks and Network Theory, pp.472723-2735, 2010.

P. Pons, Détection de communautés dans les grands graphes de terrain, 2007.

P. Pons and M. Latapy, Post-processing hierarchical community structures: Quality improvements and multi-scale view, Theoretical Computer Science, vol.412, issue.8-10, pp.8-10892, 2011.
DOI : 10.1016/j.tcs.2010.11.041
URL : https://hal.archives-ouvertes.fr/hal-01146086

J. K. Daniel-cosmin-porumbel, P. Hao, and . Kuntz, An efficient algorithm for computing the distance between close partitions, Discrete Applied Mathematics, vol.159, issue.1, pp.53-59, 2011.
DOI : 10.1016/j.dam.2010.09.002

D. Pumain, Hierarchy in Natural and Social Sciences, volume 3 of Methodos Series, 2006.

H. Purchase, Which aesthetic has the greatest effect on human understanding ? Lecture notes in computer science, pp.248-261, 1997.

H. C. Purchase, Metrics for Graph Drawing Aesthetics, Journal of Visual Languages & Computing, vol.13, issue.5, pp.501-516, 2002.
DOI : 10.1006/jvlc.2002.0232

F. Queyroi, Optimizing a hierarchical community structure of a complex network Advances In Knowledge Discovery and Management, 2012.

F. Queyroi, M. Delest, J. Fédou, and G. Melançon, Assessing the quality of multilevel graph clustering, Data Mining and Knowledge Discovery, vol.35, issue.2, 2011.
DOI : 10.1007/s10618-013-0335-9
URL : https://hal.archives-ouvertes.fr/hal-00579474

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

U. Nandini-raghavan, R. Albert, and S. Kumara, Near linear time algorithm to detect community structures in large-scale networks, Physical Review E, vol.76, issue.3, p.36106, 2007.
DOI : 10.1103/PhysRevE.76.036106

J. Reichardt and S. Bornholdt, Statistical mechanics of community detection, Physical Review E, vol.74, issue.1, p.16110, 2006.
DOI : 10.1103/PhysRevE.74.016110

N. Henry-riche and T. Dwyer, Untangling Euler Diagrams, IEEE Transactions on Visualization and Computer Graphics, vol.16, issue.6, pp.1090-1099, 2010.
DOI : 10.1109/TVCG.2010.210

P. Christian, G. Robert, and . Casella, Monte Carlo Statistical Methods (Springer Texts in Statistics), 2005.

G. O. Roberts and J. S. Rosenthal, Markov-chain monte carlo: Some practical implications of theoretical results, Canadian Journal of Statistics, vol.22, issue.4, pp.5-20, 1998.
DOI : 10.2307/3315667

D. Robinson, R. Leslie, and . Foulds, Comparison of phylogenetic trees, Mathematical Biosciences, vol.53, issue.1-2, pp.131-147, 1981.
DOI : 10.1016/0025-5564(81)90043-2

M. Rosvall and C. T. Bergstrom, Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems, PLoS ONE, vol.94, issue.4, p.18209, 2011.
DOI : 10.1371/journal.pone.0018209.t001

M. Rosvall, D. Axelsson, T. Carl, and . Bergstrom, The map equation, The European Physical Journal Special Topics, vol.178, issue.1, pp.13-23, 2009.
DOI : 10.1140/epjst/e2010-01179-1

M. Rosvall, T. Carl, and . Bergstrom, Maps of random walks on complex networks reveal community structure, Proceedings of the National Academy of Sciences, pp.1118-1123, 2008.
DOI : 10.1073/pnas.0706851105

J. Rouwendal and P. Nijkamp, Living in Two Worlds: A Review of Home-to-Work Decisions, Growth and Change, vol.750, issue.3, pp.287-303, 2004.
DOI : 10.1016/S0094-1190(02)00526-0

L. Royer, M. Reimann, B. Andreopoulos, and M. Schroeder, Unraveling Protein Networks with Power Graph Analysis, PLoS Computational Biology, vol.34, issue.7, p.1000108, 2008.
DOI : 10.1371/journal.pcbi.1000108.t004

E. Franklin and . Satterthwaite, An approximate distribution of estimates of variance components, Biometrics bulletin, vol.2, issue.6, pp.110-114, 1946.

V. Satuluri and S. Parthasarathy, Scalable graph clustering using stochastic flows, Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pp.737-746, 2009.
DOI : 10.1145/1557019.1557101

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

J. Scott, Social Network Analysis, Sociology, vol.22, issue.1, 2012.
DOI : 10.1177/0038038588022001007

C. Elwood-shannon, W. Weaver, E. Richard, B. Blahut, and . Hajek, The mathematical theory of communication, 1949.

R. Sibson, SLINK: An optimally efficient algorithm for the single-link cluster method, The Computer Journal, vol.16, issue.1, pp.30-34, 1973.
DOI : 10.1093/comjnl/16.1.30

H. A. Simon, The architecture of complexity, Proceedings of the American Philosophical Society, vol.106, issue.6, pp.467-482, 1962.

P. Simonetto, D. Auber, and D. Archambault, Fully Automatic Visualisation of Overlapping Sets, Computer Graphics Forum, pp.967-974, 2009.
DOI : 10.1111/j.1467-8659.2009.01452.x
URL : https://hal.archives-ouvertes.fr/hal-00407269

J. J. Sylvester, A question in the geometry of situation, Quarterly Journal of Pure and Applied Mathematics, vol.1, p.1857

J. J. Thomas and K. A. Cook, Illuminating the path : The research and development agenda for visual analytics, 2005.

P. Turán, A note of welcome, Journal of Graph Theory, vol.1, issue.1, pp.7-9, 1977.
DOI : 10.1002/jgt.3190010105

. Stijn-van-dongen, Graph Clustering by Flow Simulation, 2000.

F. Van-ham and B. Rogowitz, Perceptual organization in user-generated graph layouts. Visualization and Computer Graphics, IEEE Transactions on, vol.14, issue.6, pp.1333-1339, 2008.

R. Bala and . Vatti, A generic solution to polygon clipping, Communications of the ACM, vol.35, pp.56-63, 1992.

A. Vespignani, Evolution thinks modular, Nature Genetics, vol.35, issue.2, pp.118-119, 2003.
DOI : 10.1038/ng1003-118

K. Wakita and T. Tsurumi, Finding community structure in mega-scale social networks :[extended abstract, Proceedings of the 16th international conference on World Wide Web, pp.1275-1276, 2007.

C. Walshaw, A multilevel algorithm for force-directed graph drawing, Graph Drawing, pp.171-182, 2001.

H. Joe and . Ward-jr, Hierarchical grouping to optimize an objective function, Journal of the American statistical association, vol.58, issue.301, pp.236-244, 1963.

C. Ware, H. Purchase, L. Colpoys, and M. Mcgill, Cognitive measurements of graph aesthetics, Information Visualization, vol.1, issue.2, pp.103-110, 2002.
DOI : 10.1057/palgrave.ivs.9500013

S. Wasserman and J. Galaskiewicz, Advances in social network analysis : Research in the social and behavioral sciences, Sage, 1994.
DOI : 10.4135/9781452243528

J. Duncan, . Watts, H. Steven, and . Strogatz, Collective dynamics of 'smallworld'networks, nature, vol.393, issue.6684, pp.440-442, 1998.

L. Bernard and . Welch, The generalization of student's problem when several different population variances are involved, Biometrika, vol.34, issue.12, pp.28-35, 1947.

D. Brent and W. , Introduction to graph theory, Prentice hall Englewood Cliffs, vol.2, 2001.

R. Douglas, F. White, and . Harary, The cohesiveness of blocks in social networks : Node connectivity and conditional density, Sociological Methodology, vol.31, issue.1, pp.305-359, 2001.

F. Zaidi, D. Archambault, and G. Melançon, Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths, ICDM, pp.42-56, 2010.
DOI : 10.1007/978-3-642-14400-4_4
URL : https://hal.archives-ouvertes.fr/inria-00542690