{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:21:24Z","timestamp":1743067284660,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271606"},{"type":"electronic","value":"9783319271613"}],"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-27161-3_7","type":"book-chapter","created":{"date-parts":[[2015,11,17]],"date-time":"2015-11-17T23:38:40Z","timestamp":1447803520000},"page":"71-84","source":"Crossref","is-referenced-by-count":6,"title":["VSEP: A Distributed Algorithm for Graph Edge Partitioning"],"prefix":"10.1007","author":[{"given":"Yu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yanbing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Li","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,29]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M.H., Bik, A.J.C., et al.: 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":"7_CR2","unstructured":"Low, Y., Gonzalez, J.E., Kyrola, A., et al.: Graphlab: a new framework for parallel machine learning (2014). arXiv preprint \n                      arXiv:1408.2041"},{"key":"7_CR3","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., et al.: PowerGraph: distributed graph-parallel computation on natural graphs. In: OSDI, vol. 12(1), p. 2 (2012)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Xin, R.S., Gonzalez, J.E., Franklin, M.J., et al.: Graphx: a resilient distributed graph system on spark. In: First International Workshop on Graph Data Management Experiences and Systems, p. 2. ACM (2013)","DOI":"10.1145\/2484425.2484427"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: 2006 20th International Parallel and Distributed Processing Symposium, IPDPS 2006, p. 10. IEEE (2006)","DOI":"10.1109\/IPDPS.2006.1639360"},{"key":"7_CR7","unstructured":"Lang, K.: Finding good nearly balanced cuts in power law graphs (2004). Preprint"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., et al.: Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.datak.2011.11.004","volume":"72","author":"M Kim","year":"2012","unstructured":"Kim, M., Candan, K.S.: SBV-Cut: vertex-cut based graph partitioning using structural balance vertices. Data Knowl. Eng. 72, 285\u2013303 (2012)","journal-title":"Data Knowl. Eng."},{"key":"7_CR10","unstructured":"Guerrieri, A., Montresor, A.: Distributed edge partitioning for graph processing (2014). arXiv preprint \n                      arXiv:1403.6270"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-662-43352-2_15","volume-title":"Distributed Applications and Interoperable Systems","author":"F Rahimian","year":"2014","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., Haridi, S.: Distributed vertex-cut partitioning. In: Magoutis, K., Pietzuch, P. (eds.) DAIS 2014. LNCS, vol. 8460, pp. 186\u2013200. Springer, Heidelberg (2014)"},{"issue":"6794","key":"7_CR12","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barabsi, A.L.: Error and attack tolerance of complex networks. Nature 406(6794), 378\u2013382 (2000)","journal-title":"Nature"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., et al.: Ja-be-ja: a distributed algorithm for balanced graph partitioning. In: 2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO), pp. 51\u201360. IEEE (2013)","DOI":"10.1109\/SASO.2013.13"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-36605-9_14","volume-title":"Applications of Evolutionary Computing","author":"R Ba\u00f1os","year":"2003","unstructured":"Ba\u00f1os, R., Gil, C., Ortega, J., Montoya, F.G.: Multilevel heuristic algorithm for graph partitioning. In: Raidl, G.R., et al. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 143\u2013153. Springer, Heidelberg (2003)"},{"issue":"7","key":"7_CR15","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"TN Bui","year":"1996","unstructured":"Bui, T.N., Moon, B.R.: Genetic algorithm and graph partitioning. IEEE Trans. Comput. 45(7), 841\u2013855 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multi-level algorithm for partitioning graphs (1995)","DOI":"10.1145\/224170.224228"},{"issue":"1","key":"7_CR17","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."},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1137\/S0036144598334138","volume":"41","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: Parallel multilevel series k-way partitioning scheme for irregular graphs. SIAM Rev. 41(2), 278\u2013300 (1999)","journal-title":"SIAM Rev."},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM J. Sci. Comput. 22(1), 63\u201380 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-642-23719-5_40","volume-title":"Algorithms \u2013 ESA 2011","author":"P Sanders","year":"2011","unstructured":"Sanders, P., Schulz, C.: Engineering multilevel graph partitioning algorithms. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 469\u2013480. Springer, Heidelberg (2011)"},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"AJ Soper","year":"2004","unstructured":"Soper, A.J., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. J. Global Optim. 29(2), 225\u2013241 (2004)","journal-title":"J. Global Optim."},{"issue":"12","key":"7_CR22","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1109\/TC.2007.70760","volume":"56","author":"P Chardaire","year":"2007","unstructured":"Chardaire, P., Barake, M., McKeown, G.P.: A PROBE-based heuristic for graph partitioning. IEEE Trans. Comput. 56(12), 1707\u20131720 (2007)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Distributed evolutionary graph partitioning. In: ALENEX, pp. 16\u201329 (2012)","DOI":"10.1137\/1.9781611972924.2"},{"key":"7_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley, New York (2009)"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-319-14325-5_12","volume-title":"Euro-Par 2014: Parallel Processing Workshops","author":"E Carlini","year":"2014","unstructured":"Carlini, E., Dazzi, P., Esposito, A., Lulli, A., Ricci, L.: Balanced graph partitioning with apache spark. In: \u017dilinskas, J., et al. (eds.) Euro-Par 2014, Part I. LNCS, vol. 8805, pp. 129\u2013140. Springer, Heidelberg (2014)"},{"key":"7_CR26","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., et al.: Spark: cluster computing with working sets. In: Proceedings of the 2nd USENIX Conference on Hot Topics in Cloud Computing, p. 10 (2010)"},{"key":"7_CR27","unstructured":"The graph partitioning archive. \n                      http:\/\/staffweb.cms.gre.ac.uk\/~wc06\/partition"},{"key":"7_CR28","unstructured":"Stanford large network dataset collection. \n                      http:\/\/snap.stanford.edu\/data\/index.html"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27161-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:43:49Z","timestamp":1559303029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27161-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271606","9783319271613"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27161-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}