{"id":"https://openalex.org/W2152986618","doi":"https://doi.org/10.1137/s0097539792225297","title":"The Complexity of Multiterminal Cuts","display_name":"The Complexity of Multiterminal Cuts","publication_year":1994,"publication_date":"1994-08-01","ids":{"openalex":"https://openalex.org/W2152986618","doi":"https://doi.org/10.1137/s0097539792225297","mag":"2152986618"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792225297","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792225297","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/A5065666747","display_name":"Elias Dahlhaus","orcid":"https://orcid.org/0000-0001-8094-4383"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"E. Dahlhaus","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014391544","display_name":"D. S. Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104056982","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0004-6462-2316"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. H. Papadimitriou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031948088","display_name":"Paul Seymour","orcid":"https://orcid.org/0000-0003-0067-4534"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. D. Seymour","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Yannakakis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0323,"has_fulltext":false,"cited_by_count":667,"citation_normalized_percentile":{"value":0.93055717,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"23","issue":"4","first_page":"864","last_page":"894"},"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.9983000159263611,"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.9983000159263611,"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.9966999888420105,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7269871830940247},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6644827127456665},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6246716976165771},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5718184113502502},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.5358568429946899},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5111780762672424},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5072845816612244},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.49405577778816223},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47722986340522766},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4741339683532715},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4569111764431},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4359191060066223},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19296154379844666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18687939643859863}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7269871830940247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6644827127456665},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6246716976165771},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5718184113502502},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.5358568429946899},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5111780762672424},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5072845816612244},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.49405577778816223},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47722986340522766},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4741339683532715},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4569111764431},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4359191060066223},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19296154379844666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18687939643859863},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539792225297","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792225297","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.13.6534","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~dsj/papers/3way.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.4196","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.4196","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/~dsj/papers/3way.pdf","raw_type":"text"}],"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/W193832871","https://openalex.org/W1500938493","https://openalex.org/W1551635709","https://openalex.org/W1983096342","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2025896589","https://openalex.org/W2030087828","https://openalex.org/W2031248452","https://openalex.org/W2038225707","https://openalex.org/W2041131084","https://openalex.org/W2053913299","https://openalex.org/W2066577300","https://openalex.org/W2069323107","https://openalex.org/W2069702698","https://openalex.org/W2085363210","https://openalex.org/W2086565575","https://openalex.org/W2090359754","https://openalex.org/W2120424341","https://openalex.org/W2125690626","https://openalex.org/W2130045784","https://openalex.org/W2143391442","https://openalex.org/W2167637346","https://openalex.org/W2405419040","https://openalex.org/W3152126650"],"related_works":["https://openalex.org/W2129497110","https://openalex.org/W1589381382","https://openalex.org/W1572441411","https://openalex.org/W1967536438","https://openalex.org/W1575871512","https://openalex.org/W961142965","https://openalex.org/W2236098968","https://openalex.org/W1488574305","https://openalex.org/W3208371434","https://openalex.org/W1549414783"],"abstract_inverted_index":{"In":[0],"the":[1,15,35,38,48,63,120],"multiterminal":[2],"cut":[3,122],"problem":[4,64,89],"one":[5],"is":[6,20,43,46,60,90,95,106,124],"given":[7],"an":[8],"edge-weighted":[9],"graph":[10],"and":[11,19,52],"a":[12,23,111],"subset":[13],"of":[14,27,41,113,119],"vertices":[16],"called":[17],"terminals,":[18],"asked":[21],"for":[22,80,83,102],"minimum":[24],"weight":[25,123],"set":[26],"edges":[28],"that":[29,62,105],"separates":[30],"each":[31],"terminal":[32],"from":[33],"all":[34],"others.":[36],"When":[37],"number":[39],"k":[40,94],"terminals":[42],"two,":[44],"this":[45],"simply":[47],"mincut,":[49],"max-flow":[50],"problem,":[51],"can":[53,74],"be":[54,75],"solved":[55,76],"in":[56,77],"polynomial":[57,78],"time.":[58],"It":[59],"shown":[61],"becomes":[65],"NP-hard":[66],"as":[67,69],"soon":[68],"$k":[70],"=":[71],"3$,":[72],"but":[73],"time":[79],"planar":[81,88],"graphs":[82,104],"any":[84],"fixed":[85],"k.":[86],"The":[87],"NP-hard,":[91],"however,":[92],"if":[93],"not":[96],"fixed.":[97],"A":[98],"simple":[99],"approximation":[100],"algorithm":[101],"arbitrary":[103],"guaranteed":[107],"to":[108],"come":[109],"within":[110],"factor":[112],"${{2":[114],"-":[115],"2}":[116],"/":[117],"k}$":[118],"optimal":[121],"also":[125],"described.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":24},{"year":2021,"cited_by_count":27},{"year":2020,"cited_by_count":30},{"year":2019,"cited_by_count":23},{"year":2018,"cited_by_count":31},{"year":2017,"cited_by_count":19},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":27},{"year":2014,"cited_by_count":34},{"year":2013,"cited_by_count":49},{"year":2012,"cited_by_count":39}],"updated_date":"2026-07-21T08:15:58.654021","created_date":"2025-10-10T00:00:00"}