{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:53:57Z","timestamp":1771613637612,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,5,31]],"date-time":"2020-05-31T00:00:00Z","timestamp":1590883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["652976"],"award-info":[{"award-number":["652976"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Advanced Innovation Center for Big Data and Brain Computing"},{"name":"Royal Society Wolfson Research Merit Award","award":["WRM\/R1\/180014"],"award-info":[{"award-number":["WRM\/R1\/180014"]}]},{"name":"Shenzhen Institute of Computing Sciences"},{"DOI":"10.13039\/501100012659","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602023"],"award-info":[{"award-number":["61602023"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M025268\/1"],"award-info":[{"award-number":["EP\/M025268\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3318464.3389745","type":"proceedings-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T17:12:33Z","timestamp":1590772353000},"page":"1765-1779","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":49,"title":["Application Driven Graph Partitioning"],"prefix":"10.1145","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[{"name":"University of Edinburgh, Beihang University & Shenzhen University, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruochun","family":"Jin","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muyang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Lu","sequence":"additional","affiliation":[{"name":"BDBC, Beihang University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojian","family":"Luo","sequence":"additional","affiliation":[{"name":"Alibaba Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqi","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Edinburgh, Edinburgh, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Yin","sequence":"additional","affiliation":[{"name":"Alibaba Group, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingren","family":"Zhou","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Livejournal. http:\/\/snap.stanford.edu\/data\/soc-LiveJournal1.html.  Livejournal. http:\/\/snap.stanford.edu\/data\/soc-LiveJournal1.html."},{"key":"e_1_3_2_2_2_1","unstructured":"Twitter. http:\/\/twitter.com\/.  Twitter. http:\/\/twitter.com\/."},{"key":"e_1_3_2_2_3_1","volume-title":"http:\/\/law.di.unimi.it\/webdata\/uk-union-2006-06--2007-05","year":"2006","unstructured":"UKWeb. http:\/\/law.di.unimi.it\/webdata\/uk-union-2006-06--2007-05 , 2006 . UKWeb. http:\/\/law.di.unimi.it\/webdata\/uk-union-2006-06--2007-05, 2006."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2870052"},{"key":"e_1_3_2_2_5_1","volume-title":"Balanced graph partitioning. TCS, 39(6)","author":"Andreev K.","year":"2006","unstructured":"K. Andreev and H. Racke . Balanced graph partitioning. TCS, 39(6) , 2006 . K. Andreev and H. Racke. Balanced graph partitioning. TCS, 39(6), 2006."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324307"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118601181"},{"key":"e_1_3_2_2_8_1","volume-title":"Pattern recognition and machine learning. springer","author":"Bishop C. M.","year":"2006","unstructured":"C. M. Bishop . Pattern recognition and machine learning. springer , 2006 . C. M. Bishop. Pattern recognition and machine learning. springer, 2006."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623660"},{"key":"e_1_3_2_2_10_1","first-page":"107","volume-title":"WWW","author":"Brin S.","year":"1998","unstructured":"S. Brin and L. Page . The anatomy of a large-scale hypertextual Websearch engine . WWW , pages 107 -- 117 , 1998 . S. Brin and L. Page. The anatomy of a large-scale hypertextual Websearch engine. WWW, pages 107--117, 1998."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2013.11.024"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741970"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2011.6033365"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078606"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196918"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3282488"},{"key":"e_1_3_2_2_18_1","volume-title":"Computers and Intractability: A Guide tothe Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: A Guide tothe Theory of NP-Completeness . W. H. Freeman and Company , 1979 . M. Garey and D. Johnson. Computers and Intractability: A Guide tothe Theory of NP-Completeness. W. H. Freeman and Company, 1979."},{"key":"e_1_3_2_2_19_1","volume-title":"OSDI,pages 17--30","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,pages 17--30 , 2012 . J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: Distributed graph-parallel computation on natural graphs. In OSDI,pages 17--30, 2012."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904483.2904486"},{"key":"e_1_3_2_2_21_1","volume-title":"NIPS","author":"Huang L.","year":"2010","unstructured":"L. Huang , J. Jia , B. Yu , B. gon Chun , P. Maniatis , and M. Naik . Predicting execution time of computer programs using sparsepolynomial regression . In NIPS , 2010 . L. Huang, J. Jia, B. Yu, B. gon Chun, P. Maniatis, and M. Naik. Predicting execution time of computer programs using sparsepolynomial regression. In NIPS, 2010."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484425.2484429"},{"key":"e_1_3_2_2_24_1","first-page":"1117","volume-title":"Encyclopedia of Parallel Computing","author":"Karypis G.","year":"2011","unstructured":"G. Karypis . Metis and parmetis . In Encyclopedia of Parallel Computing , pages 1117 -- 1124 . 2011 . G. Karypis. Metis and parmetis. In Encyclopedia of Parallel Computing, pages 1117--1124. 2011."},{"key":"e_1_3_2_2_25_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_26_1","volume-title":"Metis: A software package for partitioning unstructured graphs. Partitioning Meshes, and ComputingFill-Reducing Orderings of Sparse Matrices Version, 4","author":"Karypis G.","year":"1998","unstructured":"G. Karypis and V. Kumar . Metis: A software package for partitioning unstructured graphs. Partitioning Meshes, and ComputingFill-Reducing Orderings of Sparse Matrices Version, 4 , 1998 . G. Karypis and V. Kumar. Metis: A software package for partitioning unstructured graphs. Partitioning Meshes, and ComputingFill-Reducing Orderings of Sparse Matrices Version, 4, 1998."},{"issue":"1","key":"e_1_3_2_2_27_1","first-page":"96","volume":"48","author":"Karypis G.","year":"1998","unstructured":"G. Karypis and V. Kumar . Multilevelk-way Partitioning Scheme forIrregular Graphs. JPDC , 48 ( 1 ): 96 -- 129 , 1998 . G. Karypis and V. Kumar. Multilevelk-way Partitioning Scheme forIrregular Graphs. JPDC, 48(1):96--129, 1998.","journal-title":"Multilevelk-way Partitioning Scheme forIrregular Graphs. JPDC"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.11.004"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.102"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324306"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824046"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213854"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.012582999"},{"key":"e_1_3_2_2_35_1","volume-title":"Relative-error prediction. Statistics & probability letters, 40(3):227--236","author":"Park H.","year":"1998","unstructured":"H. Park and L. Stefanski . Relative-error prediction. Statistics & probability letters, 40(3):227--236 , 1998 . H. Park and L. Stefanski. Relative-error prediction. Statistics & probability letters, 40(3):227--236, 1998."},{"key":"e_1_3_2_2_36_1","volume-title":"NIPS Autodiff Workshop","author":"Paszke A.","year":"2017","unstructured":"A. Paszke , S. Gross , S. Chintala , G. Chanan , E. Yang , Z. DeVito , Z. Lin , A. Desmaison , L. Antiga , and A. Lerer . Automatic differentiation in PyTorch . In NIPS Autodiff Workshop , 2017 . A. Paszke, S. Gross, S. Chintala, G. Chanan, E. Yang, Z. DeVito, Z. Lin, A. Desmaison, L. Antiga, and A. Lerer. Automatic differentiation in PyTorch. In NIPS Autodiff Workshop, 2017."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806424"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611030"},{"key":"e_1_3_2_2_40_1","volume-title":"On the computational complexity of dynamic graph problems. TCS, 158(1--2)","author":"Ramalingam G.","year":"1996","unstructured":"G. Ramalingam and T. Reps . On the computational complexity of dynamic graph problems. TCS, 158(1--2) , 1996 . G. Ramalingam and T. Reps. On the computational complexity of dynamic graph problems. TCS, 158(1--2), 1996."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-3020"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_3_2_2_43_1","volume-title":"PuLP\/XtraPuLP: Partitioning tools for extreme-scale graphs. Technical report","author":"Slota G. M.","year":"2017","unstructured":"G. M. Slota , S. Rajamanickam , and K. Madduri . PuLP\/XtraPuLP: Partitioning tools for extreme-scale graphs. Technical report , SandiaNational Lab.(SNL-NM), Albuquerque, NM (United States) , 2017 . G. M. Slota, S. Rajamanickam, and K. Madduri. PuLP\/XtraPuLP: Partitioning tools for extreme-scale graphs. Technical report, SandiaNational Lab.(SNL-NM), Albuquerque, NM (United States), 2017."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_2_46_1","volume-title":"Collective dynamics of 'small-world' networks. nature, 393(6684):440","author":"Watts D. J.","year":"1998","unstructured":"D. J. Watts and S. H. Strogatz . Collective dynamics of 'small-world' networks. nature, 393(6684):440 , 1998 . D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. nature, 393(6684):440, 1998."},{"key":"e_1_3_2_2_47_1","unstructured":"Wikipedia. Stone--Weierstrass Theorem. https:\/\/en.wikipedia.org\/wiki\/Stone-Weierstrass_theorem.  Wikipedia. Stone--Weierstrass Theorem. https:\/\/en.wikipedia.org\/wiki\/Stone-Weierstrass_theorem."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213895"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098033"},{"issue":"8","key":"e_1_3_2_2_50_1","first-page":"2091","article-title":"Maiter: An asynchronous graph processing framework for delta-based accumulative iterative computation","volume":"25","author":"Zhang Y.","year":"2013","unstructured":"Y. Zhang , Q. Gao , L. Gao , and C. Wang . Maiter: An asynchronous graph processing framework for delta-based accumulative iterative computation . TPDS , 25 ( 8 ): 2091 -- 2100 , 2013 . Y. Zhang, Q. Gao, L. Gao, and C. Wang. Maiter: An asynchronous graph processing framework for delta-based accumulative iterative computation. TPDS, 25(8):2091--2100, 2013.","journal-title":"TPDS"},{"key":"e_1_3_2_2_51_1","first-page":"301","volume-title":"OSDI","author":"Zhu X.","year":"2016","unstructured":"X. Zhu , W. Chen , W. Zheng , and X. Ma . Gemini: A computation-centric distributed graph processing system . In OSDI , pages 301 -- 316 , 2016 . X. Zhu, W. Chen, W. Zheng, and X. Ma. Gemini: A computation-centric distributed graph processing system. In OSDI, pages 301--316, 2016."}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389745","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3318464.3389745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:44Z","timestamp":1750199924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3318464.3389745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,31]]},"references-count":51,"alternative-id":["10.1145\/3318464.3389745","10.1145\/3318464"],"URL":"https:\/\/doi.org\/10.1145\/3318464.3389745","relation":{},"subject":[],"published":{"date-parts":[[2020,5,31]]},"assertion":[{"value":"2020-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}