{"id":"https://openalex.org/W3126658104","doi":"https://doi.org/10.1145/3565557","title":"Parallel Minimum Cuts in <i>O</i> ( <i>m</i> log <sup>2</sup> <i>n</i> ) Work and Low Depth","display_name":"Parallel Minimum Cuts in <i>O</i> ( <i>m</i> log <sup>2</sup> <i>n</i> ) Work and Low Depth","publication_year":2022,"publication_date":"2022-12-16","ids":{"openalex":"https://openalex.org/W3126658104","doi":"https://doi.org/10.1145/3565557","mag":"3126658104"},"language":"en","primary_location":{"id":"doi:10.1145/3565557","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3565557","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3565557","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3565557","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002283225","display_name":"Daniel Anderson","orcid":"https://orcid.org/0000-0002-5853-0472"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Daniel Anderson","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy E. Blelloch","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002283225"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.1509,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.44598822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"10","issue":"4","first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/mathematics","display_name":"Mathematics","score":0.5979467630386353},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5513998866081238},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.5176592469215393},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.5051293969154358},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4869428873062134},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.46543779969215393},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4361543357372284},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.42853233218193054},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.424783855676651},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.41571539640426636}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5979467630386353},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5513998866081238},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.5176592469215393},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.5051293969154358},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4869428873062134},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.46543779969215393},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4361543357372284},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.42853233218193054},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.424783855676651},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.41571539640426636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3565557","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3565557","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3565557","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3565557","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3565557","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3565557","source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1814763051","display_name":"AF: Small: Shared-Memory Parallel Algorithms: Theory and Practice","funder_award_id":"1910030","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6550909468","display_name":null,"funder_award_id":"CCF-1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7081150942","display_name":null,"funder_award_id":"CCF-1901381, CCF-1910030, and CCF-1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7587430710","display_name":"SHF: Medium: Algorithmic lambda-Calculus for the Design, Analysis, and Implementation of Parallel Algorithms","funder_award_id":"1901381","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G82646606","display_name":"SPX: Parallel Models and Algorithms for Emerging Memory Systems","funder_award_id":"1919223","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3126658104.pdf","grobid_xml":"https://content.openalex.org/works/W3126658104.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W639289183","https://openalex.org/W1496921672","https://openalex.org/W1497938971","https://openalex.org/W1523679426","https://openalex.org/W1532566247","https://openalex.org/W1550098107","https://openalex.org/W1822311423","https://openalex.org/W1927738121","https://openalex.org/W1964510837","https://openalex.org/W1971680255","https://openalex.org/W1974807151","https://openalex.org/W1990488650","https://openalex.org/W1996575062","https://openalex.org/W2011999472","https://openalex.org/W2012287357","https://openalex.org/W2013444956","https://openalex.org/W2018804864","https://openalex.org/W2023518480","https://openalex.org/W2025526852","https://openalex.org/W2035228443","https://openalex.org/W2042706982","https://openalex.org/W2046946959","https://openalex.org/W2078960854","https://openalex.org/W2115049345","https://openalex.org/W2121204510","https://openalex.org/W2134422938","https://openalex.org/W2138304862","https://openalex.org/W2150516767","https://openalex.org/W2168919539","https://openalex.org/W2284102689","https://openalex.org/W2436525433","https://openalex.org/W2861707247","https://openalex.org/W2919633795","https://openalex.org/W2970633507","https://openalex.org/W3000941460","https://openalex.org/W3037081898","https://openalex.org/W3041103022","https://openalex.org/W4247278211","https://openalex.org/W4255005259"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2903538031","https://openalex.org/W2129497110","https://openalex.org/W2115772827","https://openalex.org/W2942946217","https://openalex.org/W4287692398","https://openalex.org/W3047118271","https://openalex.org/W3144947242"],"abstract_inverted_index":{"We":[0,144],"present":[1],"a":[2,29,84,106,128,150,155],"randomized":[3],"O":[4,12,54,63],"(":[5,55],"m":[6,56],"log":[7,57],"2":[8],"n":[9,14,59,65],")":[10,15,60,66],"work,":[11],"(polylog":[13,64],"depth":[16],"parallel":[17,45,85,129,171],"algorithm":[18,23,32,46,69,130,147,162,172],"for":[19,131,163,173],"minimum":[20,133,164,176],"cut.":[21],"This":[22],"matches":[24],"the":[25,42,102,121,175],"work":[26,61,103,116],"bounds":[27,104],"of":[28,72,78,105,110],"recent":[30],"sequential":[31,123,161],"by":[33,47,140],"Gawrychowski,":[34],"Mozes,":[35],"and":[36,39,49,94,100,112,114,142],"Weimann":[37],"[ICALP\u201920],":[38],"improves":[40,101,136],"on":[41,96,137],"previously":[43],"best":[44,122],"Geissmann":[48,111],"Gianinazzi":[50,113],"[SPAA\u201918],":[51],"which":[52],"performs":[53],"4":[58],"in":[62,159],"depth.":[67],"Our":[68],"makes":[70],"use":[71,145],"three":[73],"components":[74],"that":[75,88,135],"might":[76],"be":[77],"independent":[79],"interest.":[80],"First,":[81],"we":[82,126,167],"design":[83,127,168],"data":[86,108],"structure":[87,109],"efficiently":[89],"supports":[90],"batched":[91],"mixed":[92],"queries":[93],"updates":[95],"trees.":[97],"It":[98],"generalizes":[99],"previous":[107,138],"is":[115],"efficient":[117,170],"with":[118],"respect":[119],"to":[120,148,153],"algorithm.":[124],"Second,":[125],"approximate":[132],"cut":[134,178],"results":[139],"Karger":[141],"Motwani.":[143],"this":[146],"give":[149],"work-efficient":[151],"procedure":[152],"produce":[154],"tree":[156],"packing,":[157],"as":[158],"Karger\u2019s":[160],"cuts.":[165],"Last,":[166],"an":[169],"solving":[174],"2-respecting":[177],"problem.":[179]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}