{"id":"https://openalex.org/W3194652383","doi":"https://doi.org/10.1145/3460890","title":"Parallel Minimum Cuts in Near-linear Work and Low Depth","display_name":"Parallel Minimum Cuts in Near-linear Work and Low Depth","publication_year":2021,"publication_date":"2021-06-30","ids":{"openalex":"https://openalex.org/W3194652383","doi":"https://doi.org/10.1145/3460890","mag":"3194652383"},"language":"en","primary_location":{"id":"doi:10.1145/3460890","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3460890","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061867758","display_name":"Barbara Geissmann","orcid":"https://orcid.org/0000-0002-9236-8798"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Barbara Geissmann","raw_affiliation_strings":["Department of Computer Science, ETH Zurich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052014295","display_name":"Lukas Gianinazzi","orcid":"https://orcid.org/0000-0001-5975-4526"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Lukas Gianinazzi","raw_affiliation_strings":["Department of Computer Science, ETH Zurich"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061867758"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15381925,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"8","issue":"2","first_page":"1","last_page":"20"},"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.9998000264167786,"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.9998000264167786,"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.9980999827384949,"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.9979000091552734,"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/logarithm","display_name":"Logarithm","score":0.7364560961723328},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6132917404174805},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5871709585189819},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5467151999473572},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5267994999885559},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5223573446273804},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5131216645240784},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5006258487701416},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4941754639148712},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.47559651732444763},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.46958106756210327},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45019060373306274},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.43845880031585693},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.41111019253730774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33722636103630066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3255574107170105},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07292023301124573}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7364560961723328},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6132917404174805},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5871709585189819},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5467151999473572},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5267994999885559},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5223573446273804},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5131216645240784},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5006258487701416},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4941754639148712},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.47559651732444763},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.46958106756210327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45019060373306274},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.43845880031585693},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.41111019253730774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33722636103630066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3255574107170105},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07292023301124573},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3460890","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3460890","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W83289625","https://openalex.org/W1513982482","https://openalex.org/W1580899643","https://openalex.org/W1963524245","https://openalex.org/W1964510837","https://openalex.org/W1975407578","https://openalex.org/W1978583881","https://openalex.org/W1983465613","https://openalex.org/W1983572666","https://openalex.org/W2013444956","https://openalex.org/W2014682451","https://openalex.org/W2018804864","https://openalex.org/W2038176627","https://openalex.org/W2057463094","https://openalex.org/W2064493067","https://openalex.org/W2075900721","https://openalex.org/W2090359754","https://openalex.org/W2095875205","https://openalex.org/W2121204510","https://openalex.org/W2130566259","https://openalex.org/W2134422938","https://openalex.org/W2168919539","https://openalex.org/W2436525433","https://openalex.org/W2606003984","https://openalex.org/W2956049318","https://openalex.org/W2983782154","https://openalex.org/W2998970133","https://openalex.org/W3035645591","https://openalex.org/W3041874268","https://openalex.org/W4290750029"],"related_works":["https://openalex.org/W2115772827","https://openalex.org/W2068595367","https://openalex.org/W115807216","https://openalex.org/W4235911878","https://openalex.org/W3210180238","https://openalex.org/W1974139762","https://openalex.org/W2005944337","https://openalex.org/W2018130031","https://openalex.org/W4286890193","https://openalex.org/W2088200711"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,31,48,90,110],"first":[3],"near-linear":[4],"work":[5,29,62],"and":[6,41,63,95],"poly-logarithmic":[7,23],"depth":[8,24],"algorithm":[9,46,105],"for":[10],"computing":[11],"a":[12,36,76,85,118],"minimum":[13,49,93,119],"cut":[14,50],"in":[15,30,54,84,87],"an":[16],"undirected":[17],"graph.":[18],"Previous":[19],"parallel":[20],"algorithms":[21],"with":[22,38,51],"required":[25],"at":[26],"least":[27],"quadratic":[28],"number":[32,111],"of":[33,99,112],"vertices.":[34],"In":[35,102],"graph":[37],"n":[39,60,67],"vertices":[40],"m":[42,57],"edges,":[43],"our":[44,104],"randomized":[45],"computes":[47],"high":[52],"probability":[53],"O":[55,64],"(":[56],"log":[58],"4":[59],")":[61,68],"(log":[65],"3":[66],"depth.":[69],"This":[70],"result":[71],"is":[72],"obtained":[73],"by":[74],"parallelizing":[75],"data":[77],"structure":[78],"that":[79],"aggregates":[80],"weights":[81],"along":[82],"paths":[83],"tree,":[86],"addition":[88],"exploiting":[89],"connection":[91],"between":[92],"cuts":[94],"approximate":[96],"maximum":[97],"packings":[98],"spanning":[100],"trees.":[101],"addition,":[103],"improves":[106],"upon":[107],"bounds":[108],"on":[109],"cache":[113],"misses":[114],"incurred":[115],"to":[116],"compute":[117],"cut.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}