{"id":"https://openalex.org/W1980410492","doi":"https://doi.org/10.1145/2684068","title":"Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","display_name":"Min <i>st</i> -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time","publication_year":2015,"publication_date":"2015-01-13","ids":{"openalex":"https://openalex.org/W1980410492","doi":"https://doi.org/10.1145/2684068","mag":"1980410492"},"language":"en","primary_location":{"id":"doi:10.1145/2684068","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2684068","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","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/A5108529502","display_name":"Glencora Borradaile","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Glencora Borradaile","raw_affiliation_strings":["Oregon State University, Corvallis OR","[Oregon State University, Corvallis, OR]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oregon State University, Corvallis OR","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"[Oregon State University, Corvallis, OR]","institution_ids":["https://openalex.org/I131249849"]}]},{"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/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":"Christian Wulff-Nilsen","raw_affiliation_strings":["University of Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5291,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.92880259,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"11","issue":"3","first_page":"1","last_page":"29"},"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.9993000030517578,"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.9993000030517578,"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.9987000226974487,"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.9969000220298767,"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/combinatorics","display_name":"Combinatorics","score":0.8117333054542542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7353278994560242},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.593176007270813},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.5666881799697876},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5104891061782837},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4998588562011719},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4983327388763428},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.47847244143486023},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4329320192337036},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43037155270576477},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4159933924674988},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1514284312725067},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10984265804290771},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.0954861044883728},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.09018969535827637},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.08443433046340942}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8117333054542542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7353278994560242},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.593176007270813},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.5666881799697876},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5104891061782837},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4998588562011719},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4983327388763428},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.47847244143486023},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4329320192337036},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43037155270576477},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4159933924674988},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1514284312725067},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10984265804290771},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0954861044883728},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.09018969535827637},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.08443433046340942}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2684068","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2684068","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/2a806341-be67-427b-a8ed-e1cfeaee5bcf","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/2a806341-be67-427b-a8ed-e1cfeaee5bcf","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Borradaile , G , Sankowski , P & Wulff-Nilsen , C 2015 , ' Min st -cut oracle for planar graphs with near-linear preprocessing time ' , A C M Transactions on Algorithms , vol. 11 , no. 3 , 16 , pp. 16:1-16:29 . https://doi.org/10.1145/2684068","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1481686123","https://openalex.org/W1563044543","https://openalex.org/W1615212840","https://openalex.org/W1964773853","https://openalex.org/W1965690159","https://openalex.org/W1966878439","https://openalex.org/W1981234161","https://openalex.org/W1990488650","https://openalex.org/W2008597108","https://openalex.org/W2029673229","https://openalex.org/W2039086323","https://openalex.org/W2049413646","https://openalex.org/W2068595367","https://openalex.org/W2078443814","https://openalex.org/W2103099082","https://openalex.org/W2115049345","https://openalex.org/W2120424341","https://openalex.org/W2166242192","https://openalex.org/W2561675875","https://openalex.org/W2610479830","https://openalex.org/W2752853835","https://openalex.org/W2762935521","https://openalex.org/W2768149714","https://openalex.org/W4243580053","https://openalex.org/W6677232678"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W2052169362","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2065008672"],"abstract_inverted_index":{"For":[0],"an":[1,108,133,176],"undirected":[2],"n":[3,53,56,63,65,118,121,127,129,180],"-vertex":[4],"planar":[5,103],"graph":[6],"G":[7,26,38],"with":[8,50,175],"nonnegative":[9],"edge":[10],"weights,":[11],"we":[12,105],"consider":[13],"the":[14,30,76,96,150,153,183],"following":[15],"type":[16],"of":[17,32,111,152],"query:":[18],"given":[19],"two":[20],"vertices":[21],"s":[22],"and":[23,60,95,124,145],"t":[24],"in":[25,37,47,102,115,139,182],",":[27],"what":[28],"is":[29,149],"weight":[31],"a":[33,70,112],"min":[34,78,93],"st":[35],"-cut":[36],"?":[39],"We":[40,68],"show":[41],"how":[42],"to":[43,73],"answer":[44],"such":[45],"queries":[46],"constant":[48],"time":[49,59,84,123,144],"O":[51,61,116,125,140],"(":[52,62,117,126,141],"log":[54,64,119,128,178],"4":[55,120],")":[57,66,122,130,143],"preprocessing":[58,184],"space.":[67,131],"use":[69],"Gomory-Hu":[71],"tree":[72],"represent":[74],"all":[75],"pairwise":[77],"cuts":[79],"implicitly.":[80],"Previously,":[81],"no":[82],"subquadratic":[83],"algorithm":[85],"was":[86],"known":[87],"for":[88],"this":[89],"problem.":[90],"Since":[91],"all-pairs":[92],"cut":[94],"minimum-cycle":[97,113],"basis":[98,114],"are":[99,161],"dual":[100],"problems":[101],"graphs,":[104],"also":[106],"obtain":[107],"implicit":[109],"representation":[110,135],"Additionally,":[132],"explicit":[134],"can":[136,164],"be":[137,165],"obtained":[138],"C":[142,148],"space":[146],"where":[147],"size":[151],"basis.":[154],"These":[155],"results":[156],"require":[157],"that":[158],"shortest":[159],"paths":[160],"unique.":[162],"This":[163],"guaranteed":[166],"either":[167],"by":[168],"using":[169],"randomization":[170],"without":[171],"overhead":[172],"or":[173],"deterministically":[174],"additional":[177],"2":[179],"factor":[181],"times.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}