A. Arenas, Network data sets, 2011.

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

M. Bern and D. Eppstein, Approximation algorithms for geometric problems, Approximation Algorithms for NP-Hard Problems, pp.296-345, 1997.

P. Boldi, B. Codenotti, M. Santini, and S. Vigna, Ubicrawler: A scalable fully distributed web crawler, Software: Practice & Experience, vol.34, issue.8, pp.711-726, 2004.

P. Boldi, M. Rosa, M. Santini, and S. Vigna, Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks, Proceedings of the 20th international conference on World Wide Web, 2011.

P. Boldi and S. Vigna, The WebGraph framework I: Compression techniques, Proc. of the Thirteenth International World Wide Web Conference, pp.595-601, 2004.

U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer et al., On finding graph clusterings with maximum modularity, Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol.4769, pp.121-132, 2007.

S. Cafieri, P. Hansen, and L. Liberti, Locally optimal heuristic for modularity maximization of networks, Phys. Rev. E, vol.83, p.56105, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00934660

Ü. V. and C. Aykanat, Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.7, pp.673-693, 1999.

A. Clauset, M. E. Newman, and C. Moore, Finding community structure in very large networks, Phys. Rev. E, vol.70, p.66111, 2004.

B. Dasgupta and D. Desai, On the complexity of Newman's finding approach for biological and social networks, 2011.

D. Delling, R. Görke, C. Schulz, and D. Wagner, Orca reduction and contraction graph clustering, Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management, pp.152-165, 2009.

H. N. Djidjev and M. Onu?, Scalable and accurate graph clustering and community structure detection, IEEE Transactions on Parallel and Distributed Systems, vol.99, 2012.

J. Duch and A. Arenas, Community detection in complex networks using extremal optimization, Phys. Rev. E, vol.72, p.27104, 2005.

B. Everitt, Cluster Analysis, 1980.

C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, DAC '82: Proceedings of the 19th Conference on Design Automation, pp.175-181, 1982.

P. F. Fine, E. D. Paolo, A. Philippides, ;. S. Nolfi, G. Baldassarre et al., Spatially constrained networks and the evolution of modular control systems, Proceedings of the Ninth International Conference on Simulation of Adaptive Behavior, vol.9, pp.546-557, 2006.

S. Fortunato and M. Barthélemy, Resolution limit in community detection, Proceedings of the National Academy of Sciences, vol.104, issue.1, pp.36-41, 2007.

M. Gaertler, R. Görke, and D. Wagner, Significance-driven graph clustering, Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07), pp.11-26, 2007.

R. Geisberger, P. Sanders, and D. Schultes, Better approximation of betweenness centrality, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), 2008.

A. K. Jain and R. C. Dubes, Algorithms for Clustering Data, 1988.

R. Kannan, S. Vempala, and A. Vetta, On clusterings: Good, bad and spectral, J. ACM, vol.51, pp.497-515, 2004.

G. Karypis and V. Kumar, MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices version 4.0, SIAM Journal on Scientific Computing, vol.20, pp.359-392, 1998.

W. Li and D. Schuurmans, Modular community detection in networks, IJCAI/AAAI, pp.1366-1371, 2011.

S. Muff, F. Rao, and A. Caflisch, Local modularity measure for network clusterizations, Phys. Rev. E, vol.72, p.56107, 2005.

M. E. Newman, Fast algorithm for detecting community structure in networks, The European Physical Journal B -Condensed Matter and Complex Systems, vol.38, pp.321-330, 2004.

M. E. Newman and M. Girvan, Finding and evaluating community structure in networks, Phys. Rev. E, vol.69, p.26113, 2004.

F. Pellegrini, SCOTCH 5.1 User's Guide, Laboratoire Bordelais de Recherche en Informatique (LaBRI), 2008.
URL : https://hal.archives-ouvertes.fr/hal-00410327

J. Reichardt and S. Bornholdt, Statistical mechanics of community detection, Phys. Rev. E, vol.74, p.16110, 2006.

C. Staudt and R. Görke, A generator for dynamic clustered random graphs, 2009.

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

E. Ziv, M. Middendorf, and C. H. Wiggins, Information-theoretic approach to network modularity, Phys. Rev. E, vol.71, p.46117, 2005.