{"id":"https://openalex.org/W4411403562","doi":"https://doi.org/10.1145/3744737","title":"Deterministic Minimum Cut in Poly-logarithmic Maximum Flows","display_name":"Deterministic Minimum Cut in Poly-logarithmic Maximum Flows","publication_year":2025,"publication_date":"2025-06-18","ids":{"openalex":"https://openalex.org/W4411403562","doi":"https://doi.org/10.1145/3744737"},"language":"en","primary_location":{"id":"doi:10.1145/3744737","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3744737","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3744737","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026118558","display_name":"Jason Li","orcid":"https://orcid.org/0000-0003-3644-0879"},"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":"Jason Li","raw_affiliation_strings":["Carnegie Mellon University","Carnegie Mellon University, Pittsburgh, United States"],"raw_orcid":"https://orcid.org/0000-0003-3644-0879","affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, United States","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Department of Computer Science, Duke University","Department of Computer Science, Duke University, Durham, United States"],"raw_orcid":"https://orcid.org/0000-0003-1799-6660","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, United States","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026118558"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.1789,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.81591824,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"72","issue":"4","first_page":"1","last_page":"18"},"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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/maximum-cut","display_name":"Maximum cut","score":0.748672604560852},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6540883779525757},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6228148937225342},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4766729176044464},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4448462128639221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39469391107559204},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38813233375549316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3262370526790619},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14087823033332825}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.748672604560852},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6540883779525757},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6228148937225342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4766729176044464},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4448462128639221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39469391107559204},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38813233375549316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3262370526790619},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14087823033332825},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3744737","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3744737","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3744737","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3744737","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1964510837","https://openalex.org/W1996575062","https://openalex.org/W2035228443","https://openalex.org/W2057463094","https://openalex.org/W2090359754","https://openalex.org/W2099463627","https://openalex.org/W2099544822","https://openalex.org/W2115049345","https://openalex.org/W2168919539","https://openalex.org/W2188455456","https://openalex.org/W2296148711","https://openalex.org/W2914414140","https://openalex.org/W2951903603","https://openalex.org/W2963972775","https://openalex.org/W3150861763","https://openalex.org/W3166491318","https://openalex.org/W3166848088","https://openalex.org/W3170659189","https://openalex.org/W4205884770","https://openalex.org/W4247278211","https://openalex.org/W4280591936","https://openalex.org/W4313227178","https://openalex.org/W4390098007","https://openalex.org/W4390575869"],"related_works":["https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W2903538031","https://openalex.org/W2129497110","https://openalex.org/W2141353198","https://openalex.org/W2115772827","https://openalex.org/W2942946217","https://openalex.org/W2078695342","https://openalex.org/W1588356204","https://openalex.org/W2130132511"],"abstract_inverted_index":{"We":[0,111,209],"give":[1,113],"a":[2,28,51,74,77,84,89,105,114,138,148],"deterministic":[3,38,78],"algorithm":[4,70,121,129],"for":[5,47,130],"finding":[6,156],"the":[7,35,44,63,125,131,171,174,212],"minimum":[8,68,79,85,90,118,159],"(weight)":[9,91],"cut":[10,69,81,87,120,214],"of":[11,55,76,93,102,108,150,158,173],"an":[12],"undirected":[13],"graph":[14],"on":[15,200],"n":[16,24],"vertices":[17,103,151,175,204],"and":[18,205],"m":[19],"edges":[20,94,207],"using":[21,185],"polylog":[22],"(":[23],")":[25,198],"calls":[26,199],"to":[27],"black":[29],"box":[30],"maximum":[31,39,187],"flow":[32,40,188],"subroutine.":[33],"Using":[34],"current":[36],"best":[37,126],"algorithms,":[41],"this":[42,48,154,181,211],"marks":[43],"first":[45],"improvement":[46],"problem":[49],"since":[50],"running":[52],"time":[53],"bound":[54],"\\(\\tilde{O}(mn)\\)":[56],"was":[57],"established":[58],"by":[59],"several":[60],"papers":[61],"in":[62],"early":[64],"1990s.":[65],"Our":[66,133],"global":[67],"is":[71,88,137],"obtained":[72],"as":[73],"corollary":[75],"Steiner":[80,86,119],"algorithm,":[82],"where":[83],"set":[92,107,149],"whose":[95],"removal":[96],"disconnects":[97],"at":[98],"least":[99],"one":[100],"pair":[101],"among":[104],"designated":[106],"terminal":[109],"vertices.":[110],"also":[112],"remarkably":[115],"simple":[116],"randomized":[117,128],"that":[122,141,161,193],"still":[123],"improves":[124],"known":[127],"problem.":[132],"main":[134],"technical":[135],"contribution":[136],"new":[139],"tool":[140],"we":[142,191],"call":[143,210],"isolating":[144,213],"cuts":[145,157],".":[146,179,216],"Given":[147],"R":[152],",":[153],"entails":[155],"weight":[160],"separate":[162],"(or":[163],"isolate)":[164],"each":[165],"individual":[166],"vertex":[167],"\\(v\\in":[168],"R\\)":[169],"from":[170],"rest":[172],"\\(R\\setminus":[176],"\\lbrace":[177],"v\\rbrace\\)":[178],"Na\u00efvely,":[180],"can":[182],"be":[183],"done":[184],"|R|":[186,197],"calls,":[189],"but":[190],"show":[192],"just":[194],"O":[195],"(log":[196],"graphs":[201],"containing":[202],"O(n)":[203],"O(m)":[206],"suffice.":[208],"lemma":[215]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}