H. Hybrid-cut and . Partitioners, https://github.com/larryxiao/spark/ [2] Stanford Large Network Dataset Collection

C. Avery, Giraph: Large-scale graph processing infrastructure on hadoop, Proceedings of the Hadoop Summit, 2011.

A. Bialecki, M. Cafarella, D. Cutting, and O. O-'malley, Hadoop: a framework for running applications on large clusters built of commodity hardware, p.11, 2005.

F. Bourse, M. Lelarge, and M. Vojnovic, Balanced graph edge partition, Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '14, pp.1456-1465, 2014.
DOI : 10.1145/2623330.2623660

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

R. Chen, J. X. Shi, H. B. Chen, and B. Y. Zang, Bipartite-Oriented Distributed Graph Partitioning for Big Learning, Journal of Computer Science and Technology, vol.42, issue.8, pp.20-29, 2015.
DOI : 10.1007/s11390-015-1501-x

R. Chen, J. Shi, Y. Chen, and H. Chen, PowerLyra, Proceedings of the Tenth European Conference on Computer Systems, EuroSys '15, 2015.
DOI : 10.1145/2741948.2741970

G. W. Flake, R. E. Tarjan, and K. Tsioutsiouliklis, Graph Clustering and Minimum Cut Trees, Internet Mathematics, vol.1, issue.4, pp.385-408, 2004.
DOI : 10.1080/15427951.2004.10129093

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.6592

J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, Powergraph: Distributed graph-parallel computation on natural graphs, Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12, pp.17-30, 2012.

A. Guerrieri and A. Montresor, DFEP: Distributed Funding-Based Edge Partitioning, European Conference on Parallel Processing, pp.346-358, 2015.
DOI : 10.1007/978-3-662-48096-0_27

N. Jain, G. Liao, and T. L. Willke, GraphBuilder, First International Workshop on Graph Data Management Experiences and Systems, GRADES '13, 2013.
DOI : 10.1145/2484425.2484429

R. Kannan, S. Vempala, and A. Vetta, On clusterings, Journal of the ACM, vol.51, issue.3, pp.497-515, 2004.
DOI : 10.1145/990308.990313

G. Karypis and V. Kumar, METIS?unstructured graph partitioning and sparse matrix ordering system, version 2, 1995.

M. Kim and K. S. 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

Y. Low, D. Bickson, J. Gonzalez, C. Guestrin, A. Kyrola et al., Distributed GraphLab, Proceedings of the VLDB Endowment, vol.5, issue.8, pp.716-727, 2012.
DOI : 10.14778/2212351.2212354

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn et al., Pregel: a system for large-scale graph processing, Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp.135-146, 2010.

H. Mykhailenko, G. Neglia, and F. Huet, Which metrics for vertex-cut partitioning?, 2016 11th International Conference for Internet Technology and Secured Transactions (ICITST), 2016.
DOI : 10.1109/ICITST.2016.7856670

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

F. Rahimian, A. H. Payberah, S. Girdzijauskas, and S. Haridi, Distributed Vertex-Cut Partitioning, 4th International Conference on Distributed Applications and Interoperable Systems (DAIS). vol. LNCS-8460, pp.186-200, 2014.
DOI : 10.1007/978-3-662-43352-2_15

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

F. Rahimian, A. H. 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

URL : http://publicatio.bibl.u-szeged.hu/3304/1/saso13.pdf

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

M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma et al., Resilient Distributed Datasets, Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation, 2012.
DOI : 10.1145/2886107.2886110