{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T17:19:26Z","timestamp":1791307166389,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662480953","type":"print"},{"value":"9783662480960","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48096-0_27","type":"book-chapter","created":{"date-parts":[[2015,7,24]],"date-time":"2015-07-24T02:16:03Z","timestamp":1437704163000},"page":"346-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["DFEP: Distributed Funding-Based Edge Partitioning"],"prefix":"10.1007","author":[{"given":"Alessio","family":"Guerrieri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Montresor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,7,25]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Andreev, K., R\u00e4cke, H.: Balanced graph partitioning. In: Proceedings of the \n                      \n                        \n                      \n                      $$16^{{\\rm th}}$$\n                     Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2004, pp. 120\u2013124. ACM (2004).\u00a0doi:\n                      10.1145\/1007912.1007931","DOI":"10.1145\/1007912.1007931"},{"key":"27_CR2","unstructured":"Bialecki, A., Cafarella, M., Cutting, D., O\u2019Malley, O.: Hadoop: a framework for running applications on large clusters built of commodity hardware. Wiki at (2005). \n                      http:\/\/lucene.apache.org\/hadoop"},{"issue":"6","key":"27_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01388998","volume":"16","author":"J Gilbert","year":"1987","unstructured":"Gilbert, J., Zmijewski, E.: A parallel graph partitioning algorithm for a message-passing multiprocessor. Int. J. Parallel Program. 16(6), 427\u2013449 (1987)","journal-title":"Int. J. Parallel Program."},{"key":"27_CR4","unstructured":"Gonzalez, J.E., Low, Y., Gu, H., Bickson, D., Guestrin, C.: Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 17\u201330 (2012)"},{"key":"27_CR5","unstructured":"Karypis, G., Kumar, V.: METIS: Unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report, University of Minnesota (1995)"},{"issue":"2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"27_CR7","unstructured":"Leskovec, J.: Stanford large network dataset collection (2011). \n                      http:\/\/snap.stanford.edu\/data\/index.html"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Malewicz, G., Austern, M., Bik, A., Dehnert, J., Horn, I., Leiser, N., Czajkowski, G.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 International Conference on Management of Data, pp. 135\u2013146. ACM (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Rahimian, F., Payberah, A.H., Girdzijauskas, S., Jelasity, M., Haridi, S.: Ja-be-ja: a distributed algorithm for balanced graph partitioning. In: Proceedings of the 7th International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2013), pp. 51\u201360. IEEE (2013)","DOI":"10.1109\/SASO.2013.13"},{"key":"27_CR10","unstructured":"Tsourakakis, C., Gkantsidis, C., Radunovic, B., Vojnovic, M.: Fennel: Streaming Graph Partitioning For Massive Scale Graphs. Microsoft Research, Cambridge (2012)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2015: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48096-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T20:33:43Z","timestamp":1587328423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48096-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480953","9783662480960"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48096-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}