{"id":"https://openalex.org/W7118994543","doi":"https://doi.org/10.1137/1.9781611978971.199","title":"Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs","display_name":"Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118994543","doi":"https://doi.org/10.1137/1.9781611978971.199"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.199","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.199","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","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/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Toyota Technological Institute at Chicago"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063639713","display_name":"Ron Mosenzon","orcid":null},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ron Mosenzon","raw_affiliation_strings":["Toyota Technological Institute at Chicago"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080971096","display_name":"Ohad Trabelsi","orcid":null},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ohad Trabelsi","raw_affiliation_strings":["University of Haifa"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Haifa","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15273478,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5586","last_page":"5623"},"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.9340999722480774,"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.9340999722480774,"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.04569999873638153,"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/T11502","display_name":"Facility Location and Emergency Management","score":0.004900000058114529,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.7192999720573425},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5442000031471252},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4853000044822693},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.45590001344680786},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.41749998927116394},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41600000858306885},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.35659998655319214},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3564999997615814},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.3264999985694885}],"concepts":[{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.7192999720573425},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5771999955177307},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5569000244140625},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5442000031471252},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5239999890327454},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4853000044822693},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.45590001344680786},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.41749998927116394},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41600000858306885},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3917999863624573},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.35659998655319214},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3564999997615814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3538999855518341},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.3264999985694885},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3188000023365021},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C148067565","wikidata":"https://www.wikidata.org/wiki/Q3323718","display_name":"Moral graph","level":5,"score":0.2831999957561493},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.28060001134872437},{"id":"https://openalex.org/C2911174283","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph Layout","level":4,"score":0.2782999873161316},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.272599995136261},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2646999955177307},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.199","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.199","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,30,48,90,97,107,119,122,152,158,169,172],"directed":[3,10,67,133,156],"global":[4,68],"minimum":[5,23,69],"vertex-cut":[6,16,70],"problem:":[7],"given":[8],"a":[9,15],"vertex-weighted":[11],"graph":[12,52],"\\(G\\),":[13],"compute":[14],"\\((L,":[17],"S,":[18],"R)\\)":[19],"in":[20,36,51,96,155,177],"\\(G\\)":[21],"of":[22,33,47,92,104,118,163,171],"value,":[24],"which":[25],"is":[26,45],"defined":[27],"to":[28,111,174],"be":[29],"total":[31],"weight":[32],"all":[34,178],"vertices":[35,95],"\\(S\\).":[37],"The":[38,61],"problem,":[39,120],"together":[40],"with":[41],"its":[42],"edge-based":[43,124,134],"variant,":[44],"one":[46],"most":[49],"basic":[50],"theory":[53],"and":[54,56,73,77,87,94,129,141,146,166],"algorithms,":[55],"has":[57,81],"been":[58],"studied":[59],"extensively.":[60],"fastest":[62],"currently":[63],"known":[64],"algorithm":[65,162],"for":[66,114,151],"(Henzinger,":[71],"Rao":[72,165],"Gabow,":[74],"FOCS":[75,139],"1996":[76,128],"J.":[78,130],"Algorithms":[79],"2000)":[80],"running":[82],"time":[83],"\\(\\tilde{O}(mn)\\),":[84],"where":[85],"\\(m\\)":[86],"\\(n\\)":[88],"denote":[89],"number":[91],"edges":[93],"input":[98],"graph,":[99],"respectively.":[100],"A":[101],"long":[102],"line":[103],"work":[105],"over":[106],"past":[108],"decades":[109],"led":[110],"faster":[112],"algorithms":[113],"other":[115],"main":[116],"versions":[117],"including":[121],"undirected":[123,142],"setting":[125,135,144],"(Karger,":[126],"STOC":[127,148],"ACM":[131],"2000),":[132],"(Cen":[136],"et":[137],"al.,":[138],"2021),":[140],"vertex-based":[143,153],"(Chuzhoy":[145],"Trabelsi,":[147],"2025).":[149],"However,":[150],"version":[154],"graphs,":[157],"29":[159],"year-old":[160],"\\(\\tilde{O}(mn)\\)-time":[161],"Henzinger,":[164],"Gabow":[167],"remains":[168],"state":[170],"art":[173],"this":[175],"day,":[176],"edge-density":[179],"regimes.":[180]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-08T00:00:00"}