{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:19:50Z","timestamp":1781518790723,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,24]],"date-time":"2014-08-24T00:00:00Z","timestamp":1408838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,24]]},"DOI":"10.1145\/2623330.2623660","type":"proceedings-article","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T19:38:46Z","timestamp":1408736326000},"page":"1456-1465","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":127,"title":["Balanced graph edge partition"],"prefix":"10.1145","author":[{"given":"Florian","family":"Bourse","sequence":"first","affiliation":[{"name":"ENS, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Lelarge","sequence":"additional","affiliation":[{"name":"INRIA-ENS, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milan","family":"Vojnovic","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1898953.1899055"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.46"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536239"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433424"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701387660"},{"key":"e_1_3_2_2_8_1","volume-title":"http:\/\/giraph.apache.org","author":"Giraph T. A. S. F.","year":"2014","unstructured":"T. A. S. F. Giraph . http:\/\/giraph.apache.org , 2014 . T. A. S. F. Giraph. http:\/\/giraph.apache.org, 2014."},{"key":"e_1_3_2_2_9_1","first-page":"17","volume-title":"OSDI'12","author":"Gonzalez J. E.","year":"2012","unstructured":"J. E. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . Powergraph: distributed graph-parallel computation on natural graphs . In OSDI'12 , pages 17 -- 30 . USENIX Association , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. Powergraph: distributed graph-parallel computation on natural graphs. In OSDI'12, pages 17--30. USENIX Association, 2012."},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings of POOSC","author":"Gregor D.","year":"2005","unstructured":"D. Gregor and A. Lumsdaine . The parallel bgl: A generic library for distributed graph computations . In Proceedings of POOSC , 2005 . D. Gregor and A. Lumsdaine. The parallel bgl: A generic library for distributed graph computations. In Proceedings of POOSC, 2005."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_3_2_2_12_1","volume-title":"Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0","author":"Karypis G.","year":"1995","unstructured":"G. Karypis and V. Kumar . Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0 . 1995 . G. Karypis and V. Kumar. Metis-unstructured graph partitioning and sparse matrix ordering system, version 2.0. 1995."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/645606.661329"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465369"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496872"},{"key":"e_1_3_2_2_19_1","volume-title":"Technical Report YRL-2004-036, Yahoo! Research Labs","author":"Lang K.","year":"2004","unstructured":"K. Lang . Finding good nearly balanced cuts in power law graphs. Technical Report YRL-2004-036, Yahoo! Research Labs , 2004 . K. Lang. Finding good nearly balanced cuts in power law graphs. Technical Report YRL-2004-036, Yahoo! Research Labs, 2004."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_2_2_22_1","first-page":"340","volume-title":"UAI","author":"Low Y.","year":"2010","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. M. Hellerstein . Graphlab: A new framework for parallel machine learning . In UAI , pages 340 -- 349 , 2010 . Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new framework for parallel machine learning. In UAI, pages 340--349, 2010."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_2_24_1","volume-title":"http:\/\/www.neo4j.org","year":"2014","unstructured":"Neo4j. http:\/\/www.neo4j.org , 2014 . Neo4j. http:\/\/www.neo4j.org, 2014."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487696"},{"key":"e_1_3_2_2_26_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-61142-8_588","volume-title":"High-Performance Computing and Networking","author":"Pellegrini F.","year":"1996","unstructured":"F. Pellegrini and J. Roman . Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs . In High-Performance Computing and Networking , volume 1067 of Lecture Notes in Computer Science , pages 493 -- 498 . Springer Berlin Heidelberg , 1996 . F. Pellegrini and J. Roman. Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In High-Performance Computing and Networking, volume 1067 of Lecture Notes in Computer Science, pages 493--498. Springer Berlin Heidelberg, 1996."},{"key":"e_1_3_2_2_27_1","first-page":"4","volume-title":"USENIX ATC'12","author":"Prabhakaran V.","year":"2012","unstructured":"V. Prabhakaran , M. Wu , X. Weng , F. McSherry , L. Zhou , and M. Haridasan . Managing large graphs on multi-cores with graph awareness . In USENIX ATC'12 , pages 4 -- 4 , 2012 . V. Prabhakaran, M. Wu, X. Weng, F. McSherry, L. Zhou, and M. Haridasan. Managing large graphs on multi-cores with graph awareness. In USENIX ATC'12, pages 4--4, 2012."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851227"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/100783352"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433461"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213957"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484427"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213895"},{"key":"e_1_3_2_2_39_1","first-page":"2","volume-title":"NSDI'12","author":"Zaharia M.","year":"2012","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. McCauley , M. J. Franklin , S. Shenker , and I. Stoica . Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing . In NSDI'12 , pages 2 -- 2 , Berkeley, CA, USA , 2012 . USENIX Association. M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In NSDI'12, pages 2--2, Berkeley, CA, USA, 2012. USENIX Association."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213839"}],"event":{"name":"KDD '14: The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"New York New York USA","acronym":"KDD '14","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2623330.2623660","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2623330.2623660","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:35Z","timestamp":1750231175000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2623330.2623660"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,24]]},"references-count":39,"alternative-id":["10.1145\/2623330.2623660","10.1145\/2623330"],"URL":"https:\/\/doi.org\/10.1145\/2623330.2623660","relation":{},"subject":[],"published":{"date-parts":[[2014,8,24]]},"assertion":[{"value":"2014-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}