{"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":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5018292222"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2249,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87608398,"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":{"Given":[0],"an":[1,10],"undirected":[2],"planar":[3,31],"graph":[4],"with":[5],"n":[6],"vertices,":[7],"we":[8],"present":[9],"$O((n\\log":[11],"n)^2":[12],")$":[13],"algorithm":[14,27],"which":[15],"finds":[16],"the":[17,22],"minimum":[18,28],"cuts":[19],"between":[20],"all":[21],"pairs":[23],"of":[24],"vertices.":[25],"Keywords":[26],"cut":[29],"multi-terminal":[30],"graphs":[32]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}