A. Abou-rjeili and G. Karypis, Multilevel algorithms for partitioning power-law graphs, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, p.10, 2006.
DOI : 10.1109/IPDPS.2006.1639360

K. Lang, Finding good nearly balanced cuts in power law graphs, 2004.

J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney, Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters, Internet Mathematics, vol.6, issue.1, pp.29-123, 2009.
DOI : 10.1080/15427951.2009.10129177

R. Albert, H. Jeong, and A. Barabási, Error and attack tolerance of complex networks, Nature, vol.1696, issue.6794, pp.378-382, 2000.
DOI : 10.1038/35019019

J. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, Powergraph: Distributed graph-parallel computation on natural graphs, Proc. of OSDI'12, pp.17-30, 2012.

R. Xin, J. Gonzalez, M. Franklin, and I. Stoica, GraphX, First International Workshop on Graph Data Management Experiences and Systems, GRADES '13, pp.1-6, 2013.
DOI : 10.1145/2484425.2484427

F. Rahimian, A. Payberah, S. Girdzijauskas, M. Jelasity, and S. Haridi, JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning, 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems, 2013.
DOI : 10.1109/SASO.2013.13

E. Talbi, Metaheuristics: from design to implementation, 2009.
DOI : 10.1002/9780470496916

URL : https://hal.archives-ouvertes.fr/hal-00750681

A. Guerrieri and A. Montresor, Distributed edge partitioning for graph processing, In: Under submission, 2013.

S. Voulgaris, D. Gavidia, and M. Van-steen, CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays, Journal of Network and Systems Management, vol.21, issue.6, pp.197-217, 2005.
DOI : 10.1007/s10922-005-4441-x

M. Jelasity and A. Montresor, Epidemic-style proactive aggregation in large overlay networks, 24th International Conference on Distributed Computing Systems, 2004. Proceedings., pp.102-109, 2004.
DOI : 10.1109/ICDCS.2004.1281573

A. Payberah, J. Dowling, and S. Haridi, Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal, Proc. of DAIS'11, pp.1-14, 2011.
DOI : 10.1007/11773887_6

J. Dowling and A. Payberah, Shuffling with a Croupier: Nat-Aware Peer-Sampling, 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp.102-111, 2012.
DOI : 10.1109/ICDCS.2012.19

L. Massoulié, L. Merrer, E. Kermarrec, A. Ganesh, and A. , Peer counting and sampling in overlay networks, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.123-132, 2006.
DOI : 10.1145/1146381.1146402

J. Leskovec, The graph partitioning archive, 2012.

J. Leskovec, Stanford large network dataset collection, 2011.

R. Baños, C. Gil, J. Ortega, and F. Montoya, Multilevel heuristic algorithm for graph partitioning, Applications of Evolutionary Computing, pp.143-153, 2003.

T. Bui and B. Moon, Genetic algorithm and graph partitioning, Transactions on Computers, vol.45, issue.7, pp.841-855, 1996.

B. Hendrickson and R. Leland, A multi-level algorithm for partitioning graphs, SC, vol.95, p.28, 1995.

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

G. Karypis and V. Kumar, Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs, SIAM Review, vol.41, issue.2, pp.278-300, 1999.
DOI : 10.1137/S0036144598334138

C. Walshaw and M. Cross, Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm, SIAM Journal on Scientific Computing, vol.22, issue.1, pp.63-80, 2000.
DOI : 10.1137/S1064827598337373

P. Sanders and C. Schulz, Engineering Multilevel Graph Partitioning Algorithms, pp.469-480, 2011.
DOI : 10.1007/978-3-642-23719-5_40

A. Soper, C. Walshaw, and M. Cross, A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning, Journal of Global Optimization, vol.29, issue.2, pp.225-241, 2004.
DOI : 10.1023/B:JOGO.0000042115.44455.f3

P. Chardaire, M. Barake, and G. Mckeown, A PROBE-Based Heuristic for Graph Partitioning, IEEE Transactions on Computers, vol.56, issue.12, pp.1707-1720, 2007.
DOI : 10.1109/TC.2007.70760

U. Benlic and J. Hao, An effective multilevel tabu search approach for balanced graph partitioning, Computers & Operations Research, vol.38, issue.7, pp.1066-1075, 2011.
DOI : 10.1016/j.cor.2010.10.007

P. Sanders and C. Schulz, Distributed evolutionary graph partitioning. arXiv preprint, 2011.

E. Talbi and P. Bessiere, A parallel genetic algorithm for the graph partitioning problem, Proceedings of the 5th international conference on Supercomputing , ICS '91, pp.312-320, 1991.
DOI : 10.1145/109025.109102

URL : https://hal.archives-ouvertes.fr/hal-00089203

G. Luque and E. Alba, Parallel Genetic Algorithms: Theory and Real World Applications, 2011.

J. Gehweiler and H. Meyerhenke, A distributed diffusive heuristic for clustering a virtual P2P supercomputer, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), pp.1-8, 2010.
DOI : 10.1109/IPDPSW.2010.5470922

L. Ramaswamy, B. Gedik, and L. Liu, A distributed approach to node clustering in decentralized peer-to-peer networks, IEEE Transactions on Parallel and Distributed Systems, vol.16, issue.9, pp.814-829, 2005.
DOI : 10.1109/TPDS.2005.101

M. Kim and K. Candan, SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices, Data & Knowledge Engineering, vol.72, pp.285-303, 2012.
DOI : 10.1016/j.datak.2011.11.004

M. Zaharia, M. Chowdhury, M. Franklin, S. Shenker, and I. Stoica, Spark: cluster computing with working sets, Proc. of HotCloud'10, USENIX, pp.10-10, 2010.

M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma et al., Resilient Distributed Datasets, Proc. of NSDI'12, USENIX, pp.2-2, 2012.
DOI : 10.1145/2886107.2886110