{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T12:49:25Z","timestamp":1749818965241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238616"},{"type":"electronic","value":"9783319238623"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23862-3_5","type":"book-chapter","created":{"date-parts":[[2015,10,13]],"date-time":"2015-10-13T14:06:06Z","timestamp":1444745166000},"page":"43-54","source":"Crossref","is-referenced-by-count":3,"title":["A Balanced Vertex Cut Partition Method in Distributed Graph Computing"],"prefix":"10.1007","author":[{"given":"Rujun","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lufei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuoning","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyu","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The np-completeness of some edge-partition problems. SIAM J. Comput. 10(4), 713\u2013717 (1981)","journal-title":"SIAM J. Comput."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Finding good approximate vertex and edge partitions is np-hard. Inf. Process. Lett. 42(3), 153\u2013159 (1992)","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Zhou, J., Bruno, N., Lin, W.: Advanced partitioning techniques for massively distributed computation. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 13\u201324. ACM (2012)","DOI":"10.1145\/2213836.2213839"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Andreev, K., Rcke, H.: Balanced graph partitioning. In: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 04, pp. 120\u2013124 (2004)","DOI":"10.1145\/1007912.1007931"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J., Dehnert, J.C., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"5_CR6","unstructured":"R. Chen et al.: Bigraph: Bipartite-aware distributed graph partition for big learning. Institute of Parallel and Distributed Systems Technical report, Number: IPADSTR-2013-002 (2013)"},{"key":"5_CR7","unstructured":"Low, Y., Gonzalez, J., Kyrola, A., Bickson, D., Guestrin, C., Hellerstein, J.M.: Graphlab: A new framework for parallel machine learning. CoRR, vol. abs\/1006.4990 (2010)"},{"issue":"8","key":"5_CR8","doi-asserted-by":"publisher","first-page":"716","DOI":"10.14778\/2212351.2212354","volume":"5","author":"Y Low","year":"2012","unstructured":"Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., Hellerstein, J.M.: Distributed graphlab: a framework for machine learning and data mining in the cloud. Proc. VLDB Endowment 5(8), 716\u2013727 (2012)","journal-title":"Proc. VLDB Endowment"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Stanton, I., Kliot, G.: Streaming graph partitioning for large distributed graphs. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1222\u20131230. ACM (2012)","DOI":"10.1145\/2339530.2339722"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bourse, F., Lelarge, M., Vojnovic, M.: Balanced graph edge partition in MSR Technical report, MSR-TR-2014-20, February 2014","DOI":"10.1145\/2623330.2623660"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"5_CR12","unstructured":"Stanford large network dataset collection. \n                    http:\/\/snap.stanford.edu\/data\/"},{"key":"5_CR13","unstructured":"Graph 500. \n                    http:\/\/www.graph500.org\/"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: ACM SIGCOMM Computer Communication Review, vol. 29, no. 4, pp. 251\u2013262. ACM (1999)","DOI":"10.1145\/316194.316229"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29\u201342. ACM (2007)","DOI":"10.1145\/1298306.1298311"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/1272998.1273005","volume":"41","author":"M Isard","year":"2007","unstructured":"Isard, M., Budiu, M., Yu, Y., Birrell, A., Fetterly, D.: Dryad: distributed data-parallel programs from sequential building blocks. ACM SIGOPS Operating Syst. Rev. 41(3), 59\u201372 (2007)","journal-title":"ACM SIGOPS Operating Syst. Rev."},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Salihoglu, S., Widom, J.: Optimizing graph algorithms on pregel-like systems (2014)","DOI":"10.14778\/2732286.2732294"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"R Angles","year":"2008","unstructured":"Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. (CSUR) 40(1), 1 (2008)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"5_CR20","unstructured":"Chen, R. et al.: Powerlyra: Differentiated graph computation and partitioning on skewed graphs. Institute of Parallel and Distributed Systems Technical report, Number:IPADSTR-2013-001 (2013)"}],"container-title":["Lecture Notes in Computer Science","Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23862-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T01:43:07Z","timestamp":1559266987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23862-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238616","9783319238623"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23862-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}