{"id":"https://openalex.org/W3166491318","doi":"https://doi.org/10.1145/3406325.3451088","title":"Vertex connectivity in poly-logarithmic max-flows","display_name":"Vertex connectivity in poly-logarithmic max-flows","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3166491318","doi":"https://doi.org/10.1145/3406325.3451088","mag":"3166491318"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451088","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451088","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451088","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451088","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100762970","display_name":"Jason Li","orcid":"https://orcid.org/0000-0002-1150-3549"},"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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","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"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Danupon Nanongkai","raw_affiliation_strings":["University of Copenhagen, Denmark / KTH, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-4468-2675","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark / KTH, Sweden","institution_ids":["https://openalex.org/I124055696"]}]},{"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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke University, USA","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, USA"],"raw_orcid":"https://orcid.org/0000-0001-8386-7168","affiliations":[{"raw_affiliation_string":"University of Michigan, USA","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/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Sorrachai Yingchareonthawornchai","raw_affiliation_strings":["Aalto University, Finland"],"raw_orcid":"https://orcid.org/0000-0002-7169-0163","affiliations":[{"raw_affiliation_string":"Aalto University, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5100762970"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":3.5002,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.93431729,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"317","last_page":"329"},"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.9987999796867371,"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/T10237","display_name":"Cryptography and Data Security","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/vertex","display_name":"Vertex (graph theory)","score":0.770002007484436},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.6983131766319275},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.633061408996582},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6009433269500732},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5743873119354248},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4800173342227936},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47776901721954346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4621816873550415},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45760607719421387},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.45338428020477295},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4212518632411957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35505586862564087},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3460181951522827}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.770002007484436},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.6983131766319275},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.633061408996582},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6009433269500732},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5743873119354248},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4800173342227936},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47776901721954346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4621816873550415},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45760607719421387},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.45338428020477295},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4212518632411957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35505586862564087},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3460181951522827},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3406325.3451088","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451088","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451088","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/f8cdd4e6-eb52-425b-a634-36d57eb8f88c","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/f8cdd4e6-eb52-425b-a634-36d57eb8f88c","pdf_url":"https://curis.ku.dk/ws/files/307228230/Vertex.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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Li , J , Nanongkai , D , Panigrahi , D , Saranurak , T & Yingchareonthawornchai , S 2021 , Vertex connectivity in poly-logarithmic max-flows . in S Khuller & V V Williams (eds) , STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery, Inc. , Proceedings of the Annual ACM Symposium on Theory of Computing , pp. 317-329 , 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 , Virtual, Online , Italy , 21/06/2021 . https://doi.org/10.1145/3406325.3451088","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3406325.3451088","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451088","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451088","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/G3254323601","display_name":null,"funder_award_id":"CCF 1750140 and CCF 1955703","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"},{"id":"https://openalex.org/G8564670903","display_name":null,"funder_award_id":"759557 and 715672","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"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"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3166491318.pdf","grobid_xml":"https://content.openalex.org/works/W3166491318.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W161718775","https://openalex.org/W1951501494","https://openalex.org/W1974912205","https://openalex.org/W1996575062","https://openalex.org/W2001004241","https://openalex.org/W2008292658","https://openalex.org/W2012310530","https://openalex.org/W2016124646","https://openalex.org/W2050021819","https://openalex.org/W2055314845","https://openalex.org/W2080745194","https://openalex.org/W2118382442","https://openalex.org/W2121204510","https://openalex.org/W2132877659","https://openalex.org/W2561675875","https://openalex.org/W2951903603","https://openalex.org/W2964010100","https://openalex.org/W3000986974","https://openalex.org/W3126916987"],"related_works":["https://openalex.org/W4287869573","https://openalex.org/W2129100545","https://openalex.org/W3187181455","https://openalex.org/W2049332363","https://openalex.org/W3021699323","https://openalex.org/W2159586130","https://openalex.org/W2080725679","https://openalex.org/W2049969628","https://openalex.org/W3004984242","https://openalex.org/W2039200643"],"abstract_inverted_index":{"The":[0],"vertex":[1,35,50,88,102],"connectivity":[2,36,51,89,103],"of":[3,13,41,100],"an":[4,113,128,141],"m-edge":[5],"n-vertex":[6],"undirected":[7],"graph":[8],"is":[9,62,92],"the":[10,18,34,68,93,97,101,109],"smallest":[11],"number":[12],"vertices":[14],"whose":[15],"removal":[16],"disconnects":[17],"graph,":[19],"or":[20],"leaves":[21],"only":[22],"a":[23,31,39,63,86],"singleton":[24],"vertex.":[25],"In":[26],"this":[27,45,84],"paper,":[28],"we":[29,47,139],"give":[30],"reduction":[32],"from":[33],"problem":[37,104],"to":[38,117],"set":[40],"maxflow":[42,65,71,143],"instances.":[43],"Using":[44,67],"reduction,":[46],"can":[48],"solve":[49],"in":[52,75,96,105],"(m\u03b1)":[53],"time":[54,77,99,131],"for":[55],"any":[56],"\u03b1":[57],"\u2265":[58],"1,":[59],"if":[60,138],"there":[61],"m\u03b1-time":[64],"algorithm.":[66,90,144],"current":[69],"best":[70,111],"algorithm":[72,115,126],"that":[73],"runs":[74],"m4/3+o(1)":[76],"(Kathuria,":[78],"Liu":[79],"and":[80,120],"Sidford,":[81],"FOCS":[82],"2020),":[83],"yields":[85],"m4/3+o(1)-time":[87],"This":[91],"first":[94],"improvement":[95],"running":[98,130],"over":[106],"20":[107],"years,":[108],"previous":[110],"being":[112],"\u00d5(mn)-time":[114],"due":[116],"Henzinger,":[118],"Rao,":[119],"Gabow":[121],"(FOCS":[122],"1996).":[123],"Indeed,":[124],"no":[125],"with":[127],"o(mn)":[129],"was":[132],"known":[133],"before":[134],"our":[135],"work,":[136],"even":[137],"assume":[140],"(m)-time":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":4}],"updated_date":"2026-05-23T08:51:43.019350","created_date":"2025-10-10T00:00:00"}