{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T13:59:51Z","timestamp":1762351191627},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:00:00Z","timestamp":1486166400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s41019-017-0034-4","type":"journal-article","created":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T14:28:39Z","timestamp":1486218519000},"page":"94-105","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Graph Partitioning for Distributed Graph Processing"],"prefix":"10.1007","volume":"2","author":[{"given":"Makoto","family":"Onizuka","sequence":"first","affiliation":[]},{"given":"Toshimasa","family":"Fujimori","sequence":"additional","affiliation":[]},{"given":"Hiroaki","family":"Shiokawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,4]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJ, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: Proceedings of SIGMOD","DOI":"10.1145\/1807167.1807184"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Low Y, Bickson D, Gonzalez J, Guestrin C, Kyrola A, Hellerstein JM (2012) Distributed GraphLab: a framework for machine learning and data mining in the cloud. PVLDB, 5(8):716\u2013727","DOI":"10.14778\/2212351.2212354"},{"key":"34_CR3","unstructured":"Gonzalez JE, Low Y, Gu H, Bickson D, Guestrin C (2012) PowerGraph: distributed graph-parallel computation on natural graphs. In: Proceedings of OSDI"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Xin RS, Gonzalez JE, Franklin MJ, Stoica I (2013) GraphX: a resilient distributed graph system on Spark. In: Proceeding of GRADES","DOI":"10.1145\/2484425.2484427"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Suri S, Vassilvitskii S (2011) Counting triangles and the curse of the last reducer. In: Proceedings of WWW","DOI":"10.1145\/1963405.1963491"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Petroni F, Querzoni Leonardo, Daudjee K, Kamali S, Iacoboni G (2015) HDRF: stream-based partitioning for power-law graphs. In: Proceeding of CIKM","DOI":"10.1145\/2806416.2806424"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69, 026113","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Wakita K, Tsurumi T (2007) Finding community structure in mega-scale social networks. In: Proceedings of WWW","DOI":"10.1145\/1242572.1242805"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Shiokawa H, Fujiwara Y (2013) Fast algorithm for modularity-based graph clustering. In: Proceeding of AAAI, Onizuka","DOI":"10.1609\/aaai.v27i1.8455"},{"key":"34_CR10","unstructured":"D\u00f3sa G, Sgall J (2013) First fit bin packing: a tight analysis. In: Proceeding of STACS"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"34_CR12","doi-asserted-by":"publisher","unstructured":"Blondel VD, Guillaume J, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp. doi: 10.1088\/1742-5468\/2008\/10\/P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Bourse F, Lelarge M, Vojnovic M (2014) Balanced graph edge partition. In: Proceeding of KDD","DOI":"10.1145\/2623330.2623660"},{"key":"34_CR14","unstructured":"Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Technical report"},{"key":"34_CR15","unstructured":"Stanford Large Network Dataset Collection (2014) http:\/\/snap.stanford.edu\/data\/ . Accessed 31 Jan 2017"},{"key":"34_CR16","unstructured":"Laboratory for Web Algorithmics (2002) http:\/\/law.di.unimi.it . Accessed 31 Jan 2017"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"McCune RR, Weninger T, Madey G (2015) Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Comput Surv 48(2):25","DOI":"10.1145\/2818185"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1999) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","DOI":"10.1137\/S1064827595287997"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the internet topology. In: Proceeding of SIGCOMM","DOI":"10.1145\/316188.316229"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-017-0034-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-017-0034-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-017-0034-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,23]],"date-time":"2022-07-23T13:51:51Z","timestamp":1658584311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-017-0034-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,4]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["34"],"URL":"https:\/\/doi.org\/10.1007\/s41019-017-0034-4","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,4]]}}}