{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:55:36Z","timestamp":1771700136442,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662433515","type":"print"},{"value":"9783662433522","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-43352-2_15","type":"book-chapter","created":{"date-parts":[[2014,5,22]],"date-time":"2014-05-22T07:26:03Z","timestamp":1400743563000},"page":"186-200","source":"Crossref","is-referenced-by-count":38,"title":["Distributed Vertex-Cut Partitioning"],"prefix":"10.1007","author":[{"given":"Fatemeh","family":"Rahimian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir H.","family":"Payberah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarunas","family":"Girdzijauskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seif","family":"Haridi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Abou-Rjeili, A., Karypis, G.: Multilevel algorithms for partitioning power-law graphs. In: Proc. of IPDPS 2006, p. 10. IEEE (2006)","DOI":"10.21236\/ADA439402"},{"key":"15_CR2","unstructured":"Lang, K.: Finding good nearly balanced cuts in power law graphs (2004) (preprint)"},{"issue":"1","key":"15_CR3","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., Dasgupta, A., Mahoney, M.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics\u00a06(1), 29\u2013123 (2009)","journal-title":"Internet Mathematics"},{"issue":"6794","key":"15_CR4","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R. Albert","year":"2000","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.: Error and attack tolerance of complex networks. Nature\u00a0406(6794), 378\u2013382 (2000)","journal-title":"Nature"},{"key":"15_CR5","unstructured":"Gonzalez, J., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: Distributed graph-parallel computation on natural graphs. In: Proc. of OSDI 2012, pp. 17\u201330 (2012)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Xin, R., Gonzalez, J., Franklin, M., Stoica, I.: Graphx: A resilient distributed graph system on spark. In: Proc. of GRADES 2013, pp. 1\u20136. ACM (2013)","DOI":"10.1145\/2484425.2484427"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Rahimian, F., Payberah, A., Girdzijauskas, S., Jelasity, M., Haridi, S.: Ja-Be-Ja: A distributed algorithm for balanced graph partitioning. In: Proc. of SASO 2013. IEEE (2013)","DOI":"10.1109\/SASO.2013.13"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Talbi, E.: Metaheuristics: From design to implementation, vol.\u00a074. John Wiley & Sons (2009)","DOI":"10.1002\/9780470496916"},{"key":"15_CR9","unstructured":"Guerrieri, A., Montresor, A.: Distributed Edge Partitioning for Graph Processing. CoRR abs\/1403.6270 (2014)"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10922-005-4441-x","volume":"13","author":"S. Voulgaris","year":"2005","unstructured":"Voulgaris, S., Gavidia, D., Van Steen, M.: Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management\u00a013(2), 197\u2013217 (2005)","journal-title":"Journal of Network and Systems Management"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: Proc. of ICDCS 2004, pp. 102\u2013109. IEEE (2004)","DOI":"10.1109\/ICDCS.2004.1281573"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-21387-8_1","volume-title":"Distributed Applications and Interoperable Systems","author":"A.H. Payberah","year":"2011","unstructured":"Payberah, A.H., Dowling, J., Haridi, S.: Gozar: Nat-friendly peer sampling with one-hop distributed nat traversal. In: Felber, P., Rouvoy, R. (eds.) DAIS 2011. LNCS, vol.\u00a06723, pp. 1\u201314. Springer, Heidelberg (2011)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Dowling, J., Payberah, A.: Shuffling with a croupier: Nat-aware peer-sampling. In: Proc. of ICDCS 2012, pp. 102\u2013111. IEEE (2012)","DOI":"10.1109\/ICDCS.2012.19"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9, L., Le Merrer, E., Kermarrec, A., Ganesh, A.: Peer counting and sampling in overlay networks: Random walk methods. In: Proc. of PODC 2006, pp. 123\u2013132. ACM (2006)","DOI":"10.1145\/1146381.1146402"},{"key":"15_CR15","unstructured":"Leskovec, J.: The graph partitioning archive (2012), http:\/\/staffweb.cms.gre.ac.uk\/~wc06\/partition"},{"key":"15_CR16","unstructured":"Leskovec, J.: Stanford large network dataset collection (2011), http:\/\/snap.stanford.edu\/data\/index.html"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Ba\u00f1os, R., Gil, C., Ortega, J., Montoya, F.G.: Multilevel heuristic algorithm for graph partitioning. In: Cagnoni, S., et al. (eds.) EvoWorkshops 2003. LNCS, vol.\u00a02611, pp. 143\u2013153. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36605-9_14"},{"issue":"7","key":"15_CR18","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"T. Bui","year":"1996","unstructured":"Bui, T., Moon, B.: Genetic algorithm and graph partitioning. Transactions on Computers\u00a045(7), 841\u2013855 (1996)","journal-title":"Transactions on Computers"},{"key":"15_CR19","first-page":"28","volume":"95","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: A multi-level algorithm for partitioning graphs. SC\u00a095, 28 (1995)","journal-title":"SC"},{"issue":"1","key":"15_CR20","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. Journal on Scientific Computing\u00a020(1), 359\u2013392 (1998)","journal-title":"Journal on Scientific Computing"},{"issue":"2","key":"15_CR21","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 Review\u00a041(2), 278\u2013300 (1999)","journal-title":"Siam Review"},{"issue":"1","key":"15_CR22","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. Journal on Scientific Computing\u00a022(1), 63\u201380 (2000)","journal-title":"Journal on Scientific Computing"},{"key":"15_CR23","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.\u00a06942, pp. 469\u2013480. Springer, Heidelberg (2011)"},{"issue":"2","key":"15_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/B:JOGO.0000042115.44455.f3","volume":"29","author":"A. Soper","year":"2004","unstructured":"Soper, A., Walshaw, C., Cross, M.: A combined evolutionary search and multilevel optimisation approach to graph-partitioning. Journal of Global Optimization\u00a029(2), 225\u2013241 (2004)","journal-title":"Journal of Global Optimization"},{"issue":"12","key":"15_CR25","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.: A probe-based heuristic for graph partitioning. Transactions on Computers\u00a056(12), 1707\u20131720 (2007)","journal-title":"Transactions on Computers"},{"issue":"7","key":"15_CR26","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1016\/j.cor.2010.10.007","volume":"38","author":"U. Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.: An effective multilevel tabu search approach for balanced graph partitioning. Computers & Operations Research\u00a038(7), 1066\u20131075 (2011)","journal-title":"Computers & Operations Research"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schulz, C.: Distributed evolutionary graph partitioning. arXiv preprint arXiv:1110.0477 (2011)","DOI":"10.1137\/1.9781611972924.2"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Talbi, E., Bessiere, P.: A parallel genetic algorithm for the graph partitioning problem. In: Proceedings of the 5th International Conference on Supercomputing, pp. 312\u2013320. ACM (1991)","DOI":"10.1145\/109025.109102"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Luque, G., Alba, E.: Parallel Genetic Algorithms: Theory and Real World Applications. SCI, vol.\u00a0367. Springer (2011)","DOI":"10.1007\/978-3-642-22084-5"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Gehweiler, J., Meyerhenke, H.: A distributed diffusive heuristic for clustering a virtual p2p supercomputer. In: Proc. of IPDPSW 2010, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/IPDPSW.2010.5470922"},{"issue":"9","key":"15_CR31","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1109\/TPDS.2005.101","volume":"16","author":"L. Ramaswamy","year":"2005","unstructured":"Ramaswamy, L., Gedik, B., Liu, L.: A distributed approach to node clustering in decentralized peer-to-peer networks. Transactions on Parallel and Distributed Systems\u00a016(9), 814\u2013829 (2005)","journal-title":"Transactions on Parallel and Distributed Systems"},{"key":"15_CR32","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.: SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices. Data & Knowledge Engineering\u00a072, 285\u2013303 (2012)","journal-title":"Data & Knowledge Engineering"},{"key":"15_CR33","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M., Shenker, S., Stoica, I.: Spark: Cluster computing with working sets. In: Proc. of HotCloud 2010, p. 10. USENIX (2010)"},{"key":"15_CR34","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M., Shenker, S., Stoica, I.: Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In: Proc. of NSDI 2012, p. 2. USENIX (2012)"}],"container-title":["Lecture Notes in Computer Science","Distributed Applications and Interoperable Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43352-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:27:42Z","timestamp":1649032062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43352-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662433515","9783662433522"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43352-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}