{"id":"https://openalex.org/W2593569673","doi":"https://doi.org/10.1137/16m1057152","title":"Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths","display_name":"Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2593569673","doi":"https://doi.org/10.1137/16m1057152","mag":"2593569673"},"language":"en","primary_location":{"id":"doi:10.1137/16m1057152","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1057152","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1703.07964","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hung-Chun Liang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hung-Chun Liang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hsueh-I Lu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hsueh-I Lu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2357,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53325702,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"31","issue":"1","first_page":"454","last_page":"476"},"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.691100001335144,"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.691100001335144,"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.19169999659061432,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.07739999890327454,"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/planar-graph","display_name":"Planar graph","score":0.6525999903678894},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.49779999256134033},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4846999943256378},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48420000076293945},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.46219998598098755},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4381999969482422},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.41819998621940613},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4104999899864197},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41029998660087585},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3788999915122986}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7937999963760376},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6941999793052673},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6525999903678894},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.49779999256134033},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4846999943256378},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48420000076293945},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.46219998598098755},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4381999969482422},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.41819998621940613},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4104999899864197},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41029998660087585},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3950999975204468},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3718999922275543},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.367900013923645},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.3610999882221222},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C131930043","wikidata":"https://www.wikidata.org/wiki/Q7200964","display_name":"Planar straight-line graph","level":5,"score":0.3361999988555908},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.32330000400543213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31299999356269836},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.298799991607666},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2799000144004822},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.27889999747276306},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.2784000039100647},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.26919999718666077},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.26249998807907104}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/16m1057152","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1057152","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1703.07964","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1703.07964","pdf_url":"https://arxiv.org/pdf/1703.07964","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1703.07964","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1703.07964","pdf_url":"https://arxiv.org/pdf/1703.07964","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W146202307","https://openalex.org/W1964510837","https://openalex.org/W1968647828","https://openalex.org/W1969357318","https://openalex.org/W1980410492","https://openalex.org/W1988593903","https://openalex.org/W1990428898","https://openalex.org/W1991858502","https://openalex.org/W2008597108","https://openalex.org/W2009669213","https://openalex.org/W2025590553","https://openalex.org/W2035228443","https://openalex.org/W2038643780","https://openalex.org/W2039267480","https://openalex.org/W2052100496","https://openalex.org/W2057463094","https://openalex.org/W2068595367","https://openalex.org/W2071406157","https://openalex.org/W2077970810","https://openalex.org/W2102559438","https://openalex.org/W2104671918","https://openalex.org/W2109920117","https://openalex.org/W2115049345","https://openalex.org/W2120424341","https://openalex.org/W2121204510","https://openalex.org/W2131676402","https://openalex.org/W2156306627","https://openalex.org/W2164141517","https://openalex.org/W2168951837","https://openalex.org/W2569270235","https://openalex.org/W2610479830","https://openalex.org/W2762935521","https://openalex.org/W2764219506","https://openalex.org/W2768149714","https://openalex.org/W4247278211"],"related_works":[],"abstract_inverted_index":{"Let":[0],"$G$":[1,25,34],"be":[2,53],"an":[3,120,155],"$n$-node":[4],"simple":[5],"directed":[6,139],"planar":[7,93],"graph":[8],"with":[9,26,35],"nonnegative":[10],"edge":[11],"weights.":[12],"We":[13],"study":[14],"the":[15,44,56,75,79,89,146],"fundamental":[16],"problems":[17,91,98],"of":[18,24,33,58,83,116,137,148],"computing":[19,125],"(1)":[20],"a":[21,31,105,110,134,138],"global":[22],"cut":[23],"minimum":[27,36],"weight":[28],"and":[29,62,152],"(2)":[30],"cycle":[32],"weight.":[37],"The":[38,69,114],"best":[39,70],"previously":[40,71],"known":[41,72],"algorithm":[42,57,82,107,123,147],"for":[43,64,74,124,154],"former":[45],"problem,":[46],"running":[47],"in":[48,92,99],"$O(n\\log^3":[49,80],"n)$":[50,102],"time,":[51],"can":[52],"obtained":[54],"from":[55,145],"\u0141a\u0327cki,":[59],"Nussbaum,":[60,150],"Sankowski,":[61,151],"Wulff-Nilsen":[63,153],"single-source":[65],"all-sinks":[66],"maximum":[67],"flows.":[68],"result":[73,118],"latter":[76],"problem":[77],"is":[78,119,143],"n)$-time":[81,122],"Wulff-Nilsen.":[84],"By":[85],"exploiting":[86],"duality":[87],"between":[88],"two":[90],"graphs,":[94],"we":[95],"solve":[96],"both":[97],"$O(n\\log":[100],"n\\log\\log":[101],"time":[103],"via":[104],"divide-and-conquer":[106],"that":[108],"finds":[109],"shortest":[111,127],"nondegenerate":[112],"cycle.":[113],"kernel":[115],"our":[117],"$O(n\\log\\log":[121],"noncrossing":[126],"paths":[128],"among":[129],"nodes":[130],"well":[131],"ordered":[132],"on":[133],"common":[135],"face":[136],"plane":[140,157],"graph,":[141],"which":[142],"extended":[144],"Italiano,":[149],"undirected":[156],"graph.":[158]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2017-03-16T00:00:00"}