{"id":"https://openalex.org/W1994153047","doi":"https://doi.org/10.1137/0209020","title":"A Multiterminal Minimum Cut Algorithm for Planar Graphs","display_name":"A Multiterminal Minimum Cut Algorithm for Planar Graphs","publication_year":1980,"publication_date":"1980-05-01","ids":{"openalex":"https://openalex.org/W1994153047","doi":"https://doi.org/10.1137/0209020","mag":"1994153047"},"language":"en","primary_location":{"id":"doi:10.1137/0209020","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209020","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5018292222","display_name":"Yossi Shiloach","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yossi Shiloach","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018292222"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1858,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87220592,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"9","issue":"2","first_page":"219","last_page":"224"},"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.9944999814033508,"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.9944999814033508,"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.9800000190734863,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9721999764442444,"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/minimum-cut","display_name":"Minimum cut","score":0.7053967118263245},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6711969971656799},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6670396327972412},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6659258604049683},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6381746530532837},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.600332498550415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5596729516983032},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4682750701904297},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4332207441329956},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41645824909210205},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35281604528427124},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28434717655181885}],"concepts":[{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.7053967118263245},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6711969971656799},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6670396327972412},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6659258604049683},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6381746530532837},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.600332498550415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5596729516983032},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4682750701904297},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4332207441329956},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41645824909210205},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35281604528427124},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28434717655181885},{"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":1,"locations":[{"id":"doi:10.1137/0209020","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209020","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2008292658","https://openalex.org/W2039086323","https://openalex.org/W2115049345"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W3141688457","https://openalex.org/W2078695342","https://openalex.org/W1974018476","https://openalex.org/W2095284441","https://openalex.org/W2121204510","https://openalex.org/W2080904092","https://openalex.org/W1581300568","https://openalex.org/W2381207282"],"abstract_inverted_index":{"Next":[0,114],"article":[1,115],"A":[2],"Multiterminal":[3],"Minimum":[4,125,220,239],"Cut":[5,121,192],"Algorithm":[6],"for":[7,171,274,292],"Planar":[8,130,195],"GraphsYossi":[9],"ShiloachYossi":[10],"Shiloachhttps://doi.org/10.1137/0209020PDFBibTexSections":[11],"ToolsAdd":[12],"to":[13],"favoritesExport":[14],"CitationTrack":[15],"CitationsEmail":[16],"SectionsAboutAbstractGiven":[17],"an":[18,27],"undirected":[19,245],"planar":[20,99,157,244],"graph":[21,54],"with":[22],"n":[23],"vertices,":[24],"we":[25],"present":[26],"$O((n\\log":[28],"n)^2":[29],")$":[30],"algorithm":[31],"which":[32],"finds":[33],"the":[34,39,124],"minimum":[35,153],"cuts":[36],"between":[37],"all":[38],"pairs":[40],"of":[41,155,193,219,242],"vertices.[1]":[42],"Shimon":[43],"Even":[44],"and":[45,52,70,92,123,133,152,230,276,294],",":[46,71,93],"R.":[47,67],"Endre":[48],"Tarjan,":[49],"Network":[50,174,197],"flow":[51,97],"testing":[53],"connectivity,":[55],"SIAM":[56,101,139,181,208],"J.":[57,78,102],"Comput.,":[58,103],"4":[59,236],"(1975),":[60],"507\u2013518":[61],"10.1137/0204043":[62],"55:9898":[63],"0328.90031":[64],"LinkGoogle":[65],"Scholar[2]":[66],"E.":[68],"Gomory":[69],"T.":[72],"C.":[73],"Hu,":[74],"Multi-terminal":[75],"network":[76,246],"flows,":[77],"Soc.":[79],"Indust.":[80],"Appl.":[81],"Math.,":[82],"9":[83],"(1961),":[84],"551\u2013570":[85],"24:B1671":[86],"0112.12405":[87],"LinkISIGoogle":[88,110],"Scholar[3]":[89],"Alon":[90],"Itai":[91],"Yossi":[94],"Shiloach,":[95],"Maximum":[96],"in":[98,198,222,247],"networks,":[100],"8":[104],"(1979),":[105],"135\u2013150":[106],"10.1137/0208012":[107],"80i:90052":[108],"0419.90040":[109],"ScholarKeywordsalgorithmminimum":[111],"cutmulti-terminalplanar":[112,279],"graphs":[113],"FiguresRelatedReferencesCited":[116],"byDetails":[117],"The":[118],"All-Pairs":[119],"Min":[120],"Problem":[122,128],"Cycle":[126],"Basis":[127],"on":[129,141,160,183,210,261],"GraphsDavid":[131],"Hartvigsen":[132],"Russell":[134],"Mardon17":[135],"February":[136],"2012":[137],"|":[138,180,207,226],"Journal":[140,182,209,260],"Discrete":[142],"Mathematics,":[143],"Vol.":[144,162,185,212,233],"7,":[145],"No.":[146,164,187,214,235],"3AbstractPDF":[147],"(2256":[148],"KB)Unifying":[149],"maximum":[150],"cut":[151,154,241],"a":[156,194,243],"graphIEEE":[158],"Transactions":[159],"Computers,":[161],"39,":[163],"5":[165],"Cross":[166,237,253],"Ref":[167,238,254],"Very":[168],"Simple":[169],"Methods":[170],"All":[172],"Pairs":[173],"Flow":[175],"AnalysisDan":[176],"Gusfield31":[177],"July":[178,205,268],"2006":[179,206,269],"Computing,":[184,211],"19,":[186],"1AbstractPDF":[188,215],"(1671":[189],"KB)Minimum":[190],"s-t":[191,240],"Undirected":[196],"$O(n\\log":[199],"^2":[200],"(n))$":[201],"TimeJohn":[202],"H.":[203],"Reif31":[204],"12,":[213],"(1107":[216],"KB)Selected":[217],"Applications":[218],"Cuts":[221],"Networks25":[223],"May":[224,251,265],"2016":[225],"INFOR:":[227],"Information":[228],"Systems":[229],"Operational":[231],"Research,":[232],"20,":[234],"o(n":[248],"log2(n))":[249],"time25":[250],"2005":[252],"Volume":[255],"9,":[256],"Issue":[257],"2|":[258],"1980SIAM":[259],"Computing":[262],"History":[263],"Submitted:02":[264],"1978Published":[266],"online:13":[267],"InformationCopyright":[270],"\u00a9":[271],"1980":[272],"Society":[273],"Industrial":[275,293],"Applied":[277,295],"MathematicsKeywordsalgorithmminimum":[278],"graphsPDF":[280],"Download":[281],"Article":[282],"&":[283],"Publication":[284],"DataArticle":[285],"DOI:10.1137/0209020Article":[286],"page":[287],"range:pp.":[288],"219-224ISSN":[289],"(print):0097-5397ISSN":[290],"(online):1095-7111Publisher:Society":[291],"Mathematics":[296]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}