A. Giraph, , 2014.

B. Bahmani, A. Chowdhury, and A. Goel, Fast incremental and personalized pagerank, VLDB, 2010.

R. Cheng, J. Hong, A. Kyrola, Y. Miao, X. Weng et al., Kineograph: Taking the pulse of a fast-changing and connected world, EUROSYS, 2012.

W. Gao and G. Cao, User-centric data dissemination in disruption tolerant networks, INFOCOM, 2011.

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability

, A Guide to the Theory of NP-Completeness, 1990.

E. Joseph, Y. Gonzalez, H. Low, D. Gu, C. Bickson et al., Powergraph: Distributed graph-parallel computation on natural graphs, OSDI, 2012.

Z. Khayyat, K. Awara, A. Alonazi, H. Jamjoom, D. Williams et al., Mizan: a system for dynamic load balancing in large-scale graph processing, EUROSYS, 2013.

G. Malewicz, M. H. Austern, J. Aart, J. C. Bik, I. Dehnert et al., Pregel: a system for large-scale graph processing, SIGMOD, 2010.

C. Martella, D. Logothetis, A. Loukas, and G. Siganos, Spinner: Scalable graph partitioning in the cloud, ICDE, 2017.

M. Josep, V. Pujol, G. Erramilli, X. Siganos, N. Yang et al., The little engine(s) that could: scaling online social networks, IEEE/ACM Trans. Netw, vol.20, issue.4, pp.1162-1175, 2012.

S. Salihoglu and J. Widom, Gps: A graph processing system, SSDBM, 2013.

I. Stanton and G. Kliot, Streaming graph partitioning for large distributed graphs, KDD, 2012.

S. Suri and S. Vassilvitskii, Counting triangles and the curse of the last reducer, WWW, 2011.

Y. Tian, A. Balmin, S. Severin-andreas-corsten, J. Tatikonda, and . Mcpherson, From "think like a vertex" to "think like a graph, 2013.

G. Leslie and . Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.

L. M. Vaquero, F. Cuadrado, D. Logothetis, and C. Martella, Adaptive partitioning for large-scale dynamic graphs, ICDCS, 2014.