{"id":"https://openalex.org/W3130726933","doi":"https://doi.org/10.1145/3546911","title":"Buffered Streaming Graph Partitioning","display_name":"Buffered Streaming Graph Partitioning","publication_year":2022,"publication_date":"2022-07-11","ids":{"openalex":"https://openalex.org/W3130726933","doi":"https://doi.org/10.1145/3546911","mag":"3130726933"},"language":"en","primary_location":{"id":"doi:10.1145/3546911","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3546911","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","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/A5007475511","display_name":"Marcelo Fonseca Faraj","orcid":"https://orcid.org/0000-0001-7100-236X"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marcelo Fonseca Faraj","raw_affiliation_strings":["Heidelberg University, Heidelberg, Germany"],"affiliations":[{"raw_affiliation_string":"Heidelberg University, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059665527","display_name":"Christian Schulz","orcid":"https://orcid.org/0000-0002-2823-3506"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Schulz","raw_affiliation_strings":["Heidelberg University, Heidelberg, Germany"],"affiliations":[{"raw_affiliation_string":"Heidelberg University, Heidelberg, Germany","institution_ids":["https://openalex.org/I223822909"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007475511"],"corresponding_institution_ids":["https://openalex.org/I223822909"],"apc_list":null,"apc_paid":null,"fwci":1.1207,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.77835014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.993399977684021,"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.7905195951461792},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.76384437084198},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6754870414733887},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.6558090448379517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4689231514930725},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46175360679626465},{"id":"https://openalex.org/keywords/auxiliary-memory","display_name":"Auxiliary memory","score":0.45059120655059814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41060003638267517},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3342345356941223},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13927298784255981},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.12894141674041748},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08345931768417358}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7905195951461792},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.76384437084198},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6754870414733887},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.6558090448379517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4689231514930725},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46175360679626465},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.45059120655059814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41060003638267517},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3342345356941223},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13927298784255981},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.12894141674041748},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08345931768417358},{"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/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3546911","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3546911","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W125936143","https://openalex.org/W324754135","https://openalex.org/W338375802","https://openalex.org/W1910515323","https://openalex.org/W1971630691","https://openalex.org/W2006023152","https://openalex.org/W2011601876","https://openalex.org/W2022490362","https://openalex.org/W2031709923","https://openalex.org/W2032950184","https://openalex.org/W2051275999","https://openalex.org/W2070232376","https://openalex.org/W2109220922","https://openalex.org/W2109726592","https://openalex.org/W2111925081","https://openalex.org/W2116450608","https://openalex.org/W2118953734","https://openalex.org/W2130747448","https://openalex.org/W2130822890","https://openalex.org/W2132202037","https://openalex.org/W2170616854","https://openalex.org/W2173213060","https://openalex.org/W2294347342","https://openalex.org/W2296407087","https://openalex.org/W2478679892","https://openalex.org/W2527814217","https://openalex.org/W2566979091","https://openalex.org/W2755088640","https://openalex.org/W2811298701","https://openalex.org/W2903746178","https://openalex.org/W2909858526","https://openalex.org/W2918921976","https://openalex.org/W2945703238","https://openalex.org/W2948637333","https://openalex.org/W2954427512","https://openalex.org/W2962788437","https://openalex.org/W2963281828","https://openalex.org/W2963653837","https://openalex.org/W2963798707","https://openalex.org/W2963883456","https://openalex.org/W2963951790","https://openalex.org/W3007162196","https://openalex.org/W3014027871","https://openalex.org/W3080343973","https://openalex.org/W3086351951","https://openalex.org/W3106371069","https://openalex.org/W3167601867","https://openalex.org/W4254407895"],"related_works":["https://openalex.org/W3139829055","https://openalex.org/W2583811263","https://openalex.org/W3134869969","https://openalex.org/W2782513589","https://openalex.org/W3173312668","https://openalex.org/W2810695303","https://openalex.org/W3012931947","https://openalex.org/W3183075326","https://openalex.org/W2035944803","https://openalex.org/W3130726933"],"abstract_inverted_index":{"Partitioning":[0],"graphs":[1,78,141,235],"into":[2],"blocks":[3,276],"of":[4,26,139,178,194,205,233,275,312],"roughly":[5],"equal":[6],"size":[7],"is":[8,19,161],"a":[9,20,58,71,109,123,143,150,162,171,176,192,198,246,302],"widely":[10],"used":[11],"tool":[12],"when":[13],"processing":[14,172],"large":[15,310],"graphs.":[16],"Currently,":[17],"there":[18,34,95],"gap":[21,129],"observed":[22],"in":[23,149,166,223],"the":[24,31,51,92,156,203,206,209,241,263,270,273,279,284],"space":[25],"available":[27],"partitioning":[28],"algorithms.":[29],"On":[30,91],"one":[32,56],"hand,":[33,94],"are":[35,96],"streaming":[36,52,151,158,264],"algorithms":[37,74,100,221],"that":[38,101,134,201,249,254],"have":[39,65],"been":[40,257],"adopted":[41],"to":[42,66,70,114,126,218,259,283],"partition":[43,76,115,212,240],"massive":[44],"graph":[45,200],"data":[46],"on":[47,225,272,291],"small":[48,304],"machines.":[49],"In":[50,118,168,307],"model,":[53,170],"vertices":[54],"arrive":[55],"at":[57],"time":[59,281],"including":[60],"their":[61,182],"neighborhood,":[62],"and":[63,208,222],"then":[64],"be":[67,260],"assigned":[68],"directly":[69],"block.":[72],"These":[73],"can":[75,174],"huge":[77,116,140,234],"quickly":[79],"with":[80,87,104,111,146,181],"little":[81,147],"memory,":[82],"but":[83,106],"they":[84],"produce":[85,102],"partitions":[86,103,138],"low":[88],"solution":[89],"quality.":[90],"other":[93],"offline":[97],"(shared-memory)":[98],"multilevel":[99,220,247],"high-quality":[105],"also":[107,268],"need":[108],"machine":[110,145],"enough":[112],"memory":[113,148],"networks.":[117],"this":[119,128,169,267],"work,":[120],"we":[121,154,196,244],"make":[122],"first":[124],"step":[125],"close":[127],"by":[130],"presenting":[131],"an":[132,251],"algorithm":[133,190,248,289,315],"computes":[135],"significantly":[136],"improved":[137],"using":[142,301],"single":[144],"setting.":[152,265],"First,":[153],"adopt":[155],"buffered":[157],"model":[159,199,215,242],"which":[160],"more":[163],"reasonable":[164],"approach":[165],"practice.":[167],"element":[173],"store":[175],"buffer":[177,305],"nodes":[179,204],"alongside":[180],"edges":[183],"before":[184],"making":[185],"assignment":[186],"decisions.":[187],"When":[188],"our":[189,288,314],"receives":[191],"batch":[193,207],"nodes,":[195],"build":[197],"represents":[202],"already":[210],"present":[211],"structure.":[213],"This":[214],"enables":[216],"us":[217],"apply":[219],"turn,":[224],"cheap":[226],"machines,":[227],"compute":[228],"much":[229],"higher":[230],"quality":[231],"solutions":[232,295],"than":[236,296,318],"previously":[237,256],"possible.":[238],"To":[239],"graph,":[243],"develop":[245],"optimizes":[250],"objective":[252],"function":[253],"has":[255],"shown":[258],"effective":[261],"for":[262,309],"Surprisingly,":[266],"removes":[269],"dependency":[271],"number":[274],"k":[277,313],"from":[278],"running":[280],"compared":[282],"previous":[285],"state-of-the-art.":[286],"Overall,":[287],"computes,":[290],"average,":[292],"75.9%":[293],"better":[294],"Fennel":[297,319],"[":[298],"35":[299],"]":[300],"very":[303],"size.":[306],"addition,":[308],"values":[311],"becomes":[316],"faster":[317],".":[320]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}