{"id":"https://openalex.org/W4411309320","doi":"https://doi.org/10.1145/3743670","title":"Vertex Connectivity in Poly-logarithmic Max-Flows","display_name":"Vertex Connectivity in Poly-logarithmic Max-Flows","publication_year":2025,"publication_date":"2025-06-14","ids":{"openalex":"https://openalex.org/W4411309320","doi":"https://doi.org/10.1145/3743670"},"language":"en","primary_location":{"id":"doi:10.1145/3743670","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3743670","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/3743670","any_repository_has_fulltext":true},"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":"middle","author":{"id":"https://openalex.org/A5074369690","display_name":"Danupon Nanongkai","orcid":"https://orcid.org/0000-0003-4468-2675"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["DE","DK","SE"],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":["KTH Royal Institute of Technology","Theoretical Computer Science, Max-Planck-Institut fur Informatik","University of Copenhagen","KTH Royal Institute of Technology, Stockholm, Sweden, University of Copenhagen, Copenhagen, Denmark and Theoretical Computer Science, Max-Planck-Institut fur Informatik, Saarbrucken, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4468-2675","affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Theoretical Computer Science, Max-Planck-Institut fur Informatik","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"University of Copenhagen","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden, University of Copenhagen, Copenhagen, Denmark and Theoretical Computer Science, Max-Planck-Institut fur Informatik, Saarbrucken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","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":["Duke University","Duke University, Durham, United States"],"raw_orcid":"https://orcid.org/0000-0003-1799-6660","affiliations":[{"raw_affiliation_string":"Duke University","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Duke University, Durham, United States","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010547647","display_name":"Thatchaphol Saranurak","orcid":"https://orcid.org/0000-0001-8386-7168"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thatchaphol Saranurak","raw_affiliation_strings":["University of Michigan","University of Michigan, Ann Arbor, United States"],"raw_orcid":"https://orcid.org/0000-0001-8386-7168","affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"University of Michigan, Ann Arbor, United States","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068060092","display_name":"Sorrachai Yingchareonthawornchai","orcid":"https://orcid.org/0000-0002-7169-0163"},"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"]},{"id":"https://openalex.org/I4210112966","display_name":"Instituto de F\u00edsica Te\u00f3rica","ror":"https://ror.org/022r8mj40","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210112966","https://openalex.org/I63634437"]},{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["CH","ES","FI"],"is_corresponding":false,"raw_author_name":"Sorrachai Yingchareonthawornchai","raw_affiliation_strings":["Computer Science, Aalto University","Institute for Theoretical Studies, ETH Zurich"],"raw_orcid":"https://orcid.org/0000-0002-7169-0163","affiliations":[{"raw_affiliation_string":"Computer Science, Aalto University","institution_ids":["https://openalex.org/I9927081"]},{"raw_affiliation_string":"Institute for Theoretical Studies, ETH Zurich","institution_ids":["https://openalex.org/I4210112966","https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":7,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5026118558"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13960956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"72","issue":"4","first_page":"1","last_page":"34"},"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.9984999895095825,"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.996999979019165,"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.6236472725868225},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5305626392364502},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4965675473213196},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4715673327445984},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3926522433757782},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12636995315551758},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.05657491087913513}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6236472725868225},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5305626392364502},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4965675473213196},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4715673327445984},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3926522433757782},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12636995315551758},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.05657491087913513}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3743670","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3743670","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"},{"id":"pmh:oai:pure.atira.dk:publications/a1a7e97f-b297-4676-87d1-87b6d64c6ad6","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/a1a7e97f-b297-4676-87d1-87b6d64c6ad6","pdf_url":"https://curis.ku.dk/ws/files/523049144/Vertex_Connectivity.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li , J , Nanongkai , D , Panigrahi , D , Saranurak , T & Yingchareonthawornchai , S 2025 , ' Vertex Connectivity in Poly-logarithmic Max-Flows ' , Journal of the ACM , vol. 72 , no. 4 , 28 . https://doi.org/10.1145/3743670","raw_type":"article"},{"id":"pmh:doi:10.3929/ethz-c-000786881","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/786881","pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/140309","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/574878a6-9cca-46f0-b534-aa61dbc0cfeb","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3743670","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3743670","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":[{"id":"https://openalex.org/G1836977259","display_name":"Distributed and Dynamic Graph Algorithms and Complexity","funder_award_id":"715672","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G1890725643","display_name":null,"funder_award_id":"2019-05622","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G2213600020","display_name":null,"funder_award_id":"2238138","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3486575691","display_name":"Novel Algorithmic Techniques through the Lens of Combinatorics","funder_award_id":"759557","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3975607665","display_name":"Collaborative Research: AF: Medium: Algorithms Meet Machine Learning: Mitigating Uncertainty in Optimization","funder_award_id":"1955703","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5226018963","display_name":"CAREER: New Directions in Graph Algorithms","funder_award_id":"1750140","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"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1951501494","https://openalex.org/W1994556169","https://openalex.org/W1996575062","https://openalex.org/W2001004241","https://openalex.org/W2008292658","https://openalex.org/W2016124646","https://openalex.org/W2050021819","https://openalex.org/W2055314845","https://openalex.org/W2080745194","https://openalex.org/W2090359754","https://openalex.org/W2111332454","https://openalex.org/W2118382442","https://openalex.org/W2121204510","https://openalex.org/W2121765622","https://openalex.org/W2132877659","https://openalex.org/W2245672739","https://openalex.org/W2951903603","https://openalex.org/W2964010100","https://openalex.org/W3000986974","https://openalex.org/W3091839222","https://openalex.org/W4390098007","https://openalex.org/W4411319913"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W3111310291"],"abstract_inverted_index":{"The":[0],"vertex":[1,36,109,130,164],"connectivity":[2,37,110,131,165],"of":[3,15,170,182],"an":[4,67,89,160],"m":[5],"-edge":[6],"n":[7,171],"-vertex":[8],"undirected":[9],"graph":[10,21],"is":[11,57,74],"the":[12,20,45,49,53,108,113,138,179],"smallest":[13],"number":[14],"vertices":[16],"whose":[17],"removal":[18],"disconnects":[19],"or":[22],"leaves":[23],"only":[24,118],"a":[25,80,99,104,119,167],"singleton":[26],"vertex.":[27],"In":[28,84],"1974,":[29],"Aho":[30],"Hopcroft":[31],"and":[32,148],"Ullman":[33],"asked":[34],"if":[35,77],"can":[38,128],"be":[39],"computed":[40],"in":[41,48,122,132],"linear":[42,134],"time.":[43],"Despite":[44],"substantial":[46],"effort":[47],"past":[50],"five":[51],"decades,":[52],"best-known":[54,180],"running":[55,72,168],"time":[56,73,135,169,176],"\\(\\tilde{O}(mn)\\)":[58,183],"by":[59,136,143,184],"Henzinger-Rao-Gabow":[60,185],"(FOCS":[61,146,151,186],"1996).":[62,187],"Indeed,":[63],"no":[64],"algorithm":[65,161],"with":[66,166],"o":[68,174],"(":[69],"mn":[70],")":[71],"known":[75],"even":[76],"we":[78,87,127,157],"assume":[79],"linear-time":[81],"max-flow":[82,114,141],"algorithm.":[83],"this":[85,93,125],"article,":[86],"give":[88],"affirmative":[90],"answer":[91],"to":[92,98,112],"long-standing":[94],"open":[95],"problem":[96,111,115],"(up":[97],"sub-polynomial":[100],"factor).":[101],"We":[102],"present":[103],"randomized":[105],"reduction":[106],"from":[107],"which":[116,177],"incurs":[117],"poly-logarithmic":[120],"overhead":[121],"runtime.":[123],"Using":[124,153],"reduction,":[126],"solve":[129],"almost":[133],"using":[137],"celebrated":[139],"almost-linear-time":[140],"algorithms":[142],"Chen-Kyng-Liu-Peng-Probst":[144],"Gutenberg-Sachdeva":[145],"2022)":[147],"Brand-Chen-Kyng-Liu-Peng-Probst":[149],"Gutenberg-Sachdeva-Sidford":[150],"2023).":[152],"our":[154],"new":[155],"techniques,":[156],"also":[158],"obtain":[159],"for":[162],"directed":[163],"2":[172],"+":[173],"(1)":[175],"improves":[178],"bound":[181]},"counts_by_year":[],"updated_date":"2026-05-23T08:51:43.019350","created_date":"2025-10-10T00:00:00"}