{"id":"https://openalex.org/W2103099082","doi":"https://doi.org/10.1145/1993636.1993679","title":"Improved algorithms for min cut and max flow in undirected planar graphs","display_name":"Improved algorithms for min cut and max flow in undirected planar graphs","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2103099082","doi":"https://doi.org/10.1145/1993636.1993679","mag":"2103099082"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993679","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993636.1993679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5086186456","display_name":"Giuseppe F. Italiano","orcid":"https://orcid.org/0000-0002-9492-9894"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Giuseppe F. Italiano","raw_affiliation_strings":["University Rome , Rome, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Rome , Rome, Italy","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017601108","display_name":"Yahav Nussbaum","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yahav Nussbaum","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025494465","display_name":"Piotr Sankowski","orcid":"https://orcid.org/0000-0002-0907-3754"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Sankowski","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland","University of Warsaw , Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077977985","display_name":"Christian Wulff\u2010Nilsen","orcid":"https://orcid.org/0000-0002-3699-7821"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Christian Wulff-Nilsen","raw_affiliation_strings":["Carleton University, Ottawa, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"313","last_page":"322"},"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.9994000196456909,"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.9994000196456909,"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.9980999827384949,"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.9922999739646912,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.7491673231124878},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6517030000686646},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6124961972236633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5828249454498291},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5704663991928101},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5704007148742676},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5675911903381348},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5479512214660645},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.5319780707359314},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5048940777778625},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4828827679157257},{"id":"https://openalex.org/keywords/polyhedral-graph","display_name":"Polyhedral graph","score":0.44825834035873413},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42589202523231506},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4161801338195801},{"id":"https://openalex.org/keywords/planar-straight-line-graph","display_name":"Planar straight-line graph","score":0.4140723645687103},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3650193512439728},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.24662461876869202},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23905432224273682},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.22315728664398193},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07764104008674622}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7491673231124878},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6517030000686646},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6124961972236633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5828249454498291},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5704663991928101},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5704007148742676},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5675911903381348},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5479512214660645},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.5319780707359314},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5048940777778625},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4828827679157257},{"id":"https://openalex.org/C91233654","wikidata":"https://www.wikidata.org/wiki/Q4555371","display_name":"Polyhedral graph","level":5,"score":0.44825834035873413},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42589202523231506},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4161801338195801},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.4140723645687103},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3650193512439728},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.24662461876869202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23905432224273682},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.22315728664398193},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07764104008674622},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1993636.1993679","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993636.1993679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:art.torvergata.it:2108/70269","is_oa":false,"landing_page_url":"http://hdl.handle.net/2108/70269","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W1974358136","https://openalex.org/W1987197912","https://openalex.org/W2002531683","https://openalex.org/W2006152944","https://openalex.org/W2032846330","https://openalex.org/W2038643780","https://openalex.org/W2039086323","https://openalex.org/W2039267480","https://openalex.org/W2049413646","https://openalex.org/W2066108505","https://openalex.org/W2068595367","https://openalex.org/W2078443814","https://openalex.org/W2083049364","https://openalex.org/W2090359754","https://openalex.org/W2093762675","https://openalex.org/W2093766264","https://openalex.org/W2113501450","https://openalex.org/W2120424341","https://openalex.org/W2121473031","https://openalex.org/W2147510331","https://openalex.org/W2243432867","https://openalex.org/W2762935521","https://openalex.org/W2768149714","https://openalex.org/W4213060883","https://openalex.org/W6643783730"],"related_works":["https://openalex.org/W2186707160","https://openalex.org/W1974018476","https://openalex.org/W3141688457","https://openalex.org/W2078695342","https://openalex.org/W2141353198","https://openalex.org/W2095284441","https://openalex.org/W2121204510","https://openalex.org/W2590727506","https://openalex.org/W3155269421","https://openalex.org/W1581300568"],"abstract_inverted_index":{"We":[0,175],"study":[1],"the":[2,52,56,70,74,100,103,107,180],"min":[3,38,104,136,187],"st-cut":[4,39,188],"and":[5,15,30,34,106,129,132,146,189],"max":[6,61,108,190],"st-flow":[7,62,138],"problems":[8],"in":[9,13,16,40,63,110,148],"planar":[10,28,66,117,167],"graphs,":[11],"both":[12],"static":[14],"dynamic":[17,97,162,184],"settings.":[18],"First,":[19],"we":[20,47,93],"present":[21,94],"an":[22,26,64,111],"algorithm":[23,98,124,165,185],"that":[24,177],"given":[25],"undirected":[27,65,112],"graph":[29,114,118],"two":[31,81],"vertices":[32,144],"s":[33,145],"t":[35,147],"computes":[36],"a":[37,60,95,116,120,160],"O(n":[41,75],"log":[42,43,76],"n)":[44,77,151],"time.":[45],"Second,":[46],"show":[48],"how":[49],"to":[50,127],"achieve":[51],"same":[53],"bound":[54],"for":[55,79,87,135,166,186],"problem":[57],"of":[58,102,143,172],"computing":[59],"graph.":[67],"These":[68],"are":[69],"first":[71,181],"algorithms":[72],"breaking":[73],"barrier":[78],"those":[80],"problems,":[82],"which":[83,169],"has":[84],"been":[85],"standing":[86],"more":[88],"than":[89],"25":[90],"years.":[91],"Third,":[92],"fully":[96],"maintaining":[99],"value":[101],"st-cuts":[105],"st-flows":[109],"plane":[113],"(i.e.,":[115],"with":[119],"fixed":[121],"embedding):":[122],"our":[123],"is":[125,157,179],"able":[126],"insert":[128],"delete":[130],"edges":[131],"answer":[133],"queries":[134],"st-cut/max":[137],"values":[139],"between":[140],"any":[141],"pair":[142],"O(n(2/3)":[149],"log(8/3)":[150],"time":[152],"per":[153],"operation.":[154],"This":[155],"result":[156],"based":[158],"on":[159],"new":[161],"shortest":[163],"path":[164],"graphs":[168],"may":[170],"be":[171],"independent":[173],"interest.":[174],"remark":[176],"this":[178],"known":[182],"non-trivial":[183],"st-flow.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}