{"id":"https://openalex.org/W2745138925","doi":"https://doi.org/10.1145/3097983.3098033","title":"Graph Edge Partitioning via Neighborhood Heuristic","display_name":"Graph Edge Partitioning via Neighborhood Heuristic","publication_year":2017,"publication_date":"2017-08-04","ids":{"openalex":"https://openalex.org/W2745138925","doi":"https://doi.org/10.1145/3097983.3098033","mag":"2745138925"},"language":"en","primary_location":{"id":"doi:10.1145/3097983.3098033","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3097983.3098033","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048212796","display_name":"Chenzi Zhang","orcid":"https://orcid.org/0000-0002-1911-6439"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Chenzi Zhang","raw_affiliation_strings":["University of Hong Kong & Noah's Ark Lab, Hong Kong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hong Kong & Noah's Ark Lab, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100911449","display_name":"Fan Wei","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fan Wei","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100432519","display_name":"Qin Liu","orcid":"https://orcid.org/0000-0003-3442-0831"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Qin Liu","raw_affiliation_strings":["Huawei Noah's Ark Lab & Chinese University of Hong Kong, Hong Kong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huawei Noah's Ark Lab & Chinese University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032128738","display_name":"Zhihao Gavin Tang","orcid":"https://orcid.org/0000-0002-5094-1971"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Zhihao Gavin Tang","raw_affiliation_strings":["University of Hong Kong, Hong Kong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103196797","display_name":"Zhenguo Li","orcid":"https://orcid.org/0000-0002-8492-3069"},"institutions":[{"id":"https://openalex.org/I2250955327","display_name":"Huawei Technologies (China)","ror":"https://ror.org/00cmhce21","country_code":"CN","type":"company","lineage":["https://openalex.org/I2250955327"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhenguo Li","raw_affiliation_strings":["Huawei Noah's Ark Lab, Hong Kong, Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Huawei Noah's Ark Lab, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I2250955327"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"605","last_page":"614"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6070076823234558},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.6055828928947449},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5628371238708496},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4804617762565613},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45070430636405945},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43125784397125244},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4276576638221741},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4177054166793823},{"id":"https://openalex.org/keywords/replication","display_name":"Replication (statistics)","score":0.4163905680179596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3869715929031372},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3632347583770752},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33323997259140015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2948713004589081},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28186365962028503}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6070076823234558},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.6055828928947449},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5628371238708496},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4804617762565613},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45070430636405945},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43125784397125244},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4276576638221741},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4177054166793823},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.4163905680179596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3869715929031372},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3632347583770752},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33323997259140015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2948713004589081},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28186365962028503},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3097983.3098033","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3097983.3098033","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W1448681276","https://openalex.org/W1978555214","https://openalex.org/W1986603225","https://openalex.org/W2031709923","https://openalex.org/W2070232376","https://openalex.org/W2072901340","https://openalex.org/W2096544401","https://openalex.org/W2097147952","https://openalex.org/W2101196063","https://openalex.org/W2106515361","https://openalex.org/W2150117348","https://openalex.org/W2166469213","https://openalex.org/W2169015768","https://openalex.org/W2170616854","https://openalex.org/W2244188037","https://openalex.org/W2755088640","https://openalex.org/W3009233884"],"related_works":["https://openalex.org/W4205713785","https://openalex.org/W3016766501","https://openalex.org/W4398287560","https://openalex.org/W4398914716","https://openalex.org/W4398619072","https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W1598028160","https://openalex.org/W3211941742","https://openalex.org/W2035944803"],"abstract_inverted_index":{"We":[0,57,76],"consider":[1],"the":[2,8,20,96,118,144,149],"edge":[3,103],"partitioning":[4,70,104,130],"problem":[5,36,62],"that":[6,60,128],"partitions":[7],"edges":[9],"of":[10,23,82,121],"an":[11],"input":[12],"graph":[13,50,151],"into":[14],"multiple":[15],"balanced":[16],"components,":[17],"while":[18],"minimizing":[19,40],"total":[21],"number":[22],"vertices":[24],"replicated":[25],"(one":[26],"vertex":[27],"might":[28],"appear":[29],"in":[30,39,148,154],"more":[31],"than":[32,143],"one":[33],"partition).":[34],"This":[35],"is":[37,63],"critical":[38],"communication":[41],"costs":[42],"and":[43,65,161,167],"running":[44,74,162],"time":[45,163],"for":[46,85,102],"several":[47],"large-scale":[48],"distributed":[49],"computation":[51],"platforms":[52],"(e.g.,":[53],"PowerGraph,":[54,153],"Spark":[55],"GraphX).":[56],"first":[58,97],"prove":[59],"this":[61,110],"NP-hard,":[64],"then":[66],"present":[67],"a":[68,78],"new":[69],"heuristic":[71,87],"with":[72],"polynomial":[73],"time.":[75],"provide":[77,99],"worst-case":[79],"upper":[80],"bound":[81,101,111],"replication":[83,123,136,158],"factor":[84],"our":[86,92,129],"on":[88,106,138],"general":[89,107],"graphs.":[90,108],"To":[91],"knowledge,":[93],"we":[94],"are":[95],"to":[98,112],"such":[100],"algorithms":[105],"Applying":[109],"random":[113],"power-law":[114],"graphs":[115],"greatly":[116],"improves":[117],"previous":[119],"bounds":[120],"expected":[122],"factor.":[124],"Extensive":[125],"experiments":[126],"demonstrated":[127],"algorithm":[131],"consistently":[132],"produces":[133],"much":[134],"smaller":[135],"factors":[137],"various":[139],"benchmark":[140],"data":[141],"sets":[142],"state-of-the-art.":[145],"When":[146],"deployed":[147],"production":[150],"engine,":[152],"average":[155],"it":[156],"reduces":[157],"factor,":[159],"communication,":[160],"by":[164],"54%,":[165],"66%,":[166],"21%,":[168],"respectively.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":21},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}