{"id":"https://openalex.org/W1974901680","doi":"https://doi.org/10.1016/s0166-218x(98)00036-5","title":"The planar multiterminal cut problem","display_name":"The planar multiterminal cut problem","publication_year":1998,"publication_date":"1998-07-01","ids":{"openalex":"https://openalex.org/W1974901680","doi":"https://doi.org/10.1016/s0166-218x(98)00036-5","mag":"1974901680"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(98)00036-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(98)00036-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X98000365/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.sciencedirect.com/science/article/pii/S0166218X98000365/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079559219","display_name":"David Hartvigsen","orcid":"https://orcid.org/0000-0001-8353-5577"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]},{"id":"https://openalex.org/I931278978","display_name":"College of Business Administration","ror":"https://ror.org/03x1zq178","country_code":"LV","type":"education","lineage":["https://openalex.org/I931278978"]}],"countries":["LV","US"],"is_corresponding":true,"raw_author_name":"David Hartvigsen","raw_affiliation_strings":["Department of Management, College of Business Administration, University of Notre Dame, Notre Dame. IN 46556-5641, USA","Department of Management, College of Business Administration, University of Notre Dame, Notre Dame, IN 46556-5641, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Management, College of Business Administration, University of Notre Dame, Notre Dame. IN 46556-5641, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Management, College of Business Administration, University of Notre Dame, Notre Dame, IN 46556-5641, USA#TAB#","institution_ids":["https://openalex.org/I931278978"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079559219"],"corresponding_institution_ids":["https://openalex.org/I107639228","https://openalex.org/I931278978"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":{"value":2750,"currency":"USD","value_usd":2750},"fwci":0.9749,"has_fulltext":true,"cited_by_count":30,"citation_normalized_percentile":{"value":0.72979123,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"85","issue":"3","first_page":"203","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980999827384949,"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/mathematics","display_name":"Mathematics","score":0.869446873664856},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7513641119003296},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.7255775928497314},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6932138204574585},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.692318856716156},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6213455200195312},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.5732995867729187},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.49954962730407715},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46421459317207336},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.45025551319122314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44476258754730225},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.43247532844543457},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4106893539428711},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13201051950454712}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.869446873664856},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7513641119003296},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.7255775928497314},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6932138204574585},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.692318856716156},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6213455200195312},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5732995867729187},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.49954962730407715},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46421459317207336},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.45025551319122314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44476258754730225},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43247532844543457},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4106893539428711},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13201051950454712},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0166-218x(98)00036-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(98)00036-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X98000365/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s0166-218x(98)00036-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(98)00036-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X98000365/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1974901680.pdf","grobid_xml":"https://content.openalex.org/works/W1974901680.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W41039768","https://openalex.org/W572096878","https://openalex.org/W1513400187","https://openalex.org/W1551635709","https://openalex.org/W1964119857","https://openalex.org/W1965680834","https://openalex.org/W1965690159","https://openalex.org/W1979750070","https://openalex.org/W1983096342","https://openalex.org/W1995818744","https://openalex.org/W2017927472","https://openalex.org/W2025214096","https://openalex.org/W2031248452","https://openalex.org/W2041131084","https://openalex.org/W2068595367","https://openalex.org/W2069702698","https://openalex.org/W2090872479","https://openalex.org/W2115049345","https://openalex.org/W2120424341","https://openalex.org/W2127631842","https://openalex.org/W2152986618","https://openalex.org/W2167637346","https://openalex.org/W2405419040","https://openalex.org/W6601656252","https://openalex.org/W6641692026","https://openalex.org/W6645132891","https://openalex.org/W6656621899"],"related_works":["https://openalex.org/W2129497110","https://openalex.org/W1572441411","https://openalex.org/W1967536438","https://openalex.org/W4289685524","https://openalex.org/W2905360057","https://openalex.org/W2885987986","https://openalex.org/W3208371434","https://openalex.org/W1581300568","https://openalex.org/W2236098968","https://openalex.org/W4225947064"],"abstract_inverted_index":{"Let":[0],"G":[1,61],"=":[2,41],"(V,":[3,42],"E)":[4],"be":[5],"a":[6,22,72,91,100,107,137],"graph":[7],"with":[8],"positive":[9],"edge":[10],"weights":[11],"and":[12,81,99,135],"let":[13],"V'\u2286V.":[14],"The":[15,64,87,116],"min":[16,57,78,96,113],"V1-cut":[17],"problem":[18,59,80,98,129],"is":[19,62,119],"to":[20,55,131],"find":[21],"minimum":[23],"weight":[24],"set":[25],"E'\u2286E":[26],"such":[27],"that":[28],"no":[29],"two":[30,48],"nodes":[31],"of":[32,39],"V'":[33],"occur":[34],"in":[35,106],"the":[36,56,69,76,82,94,111,122],"same":[37],"component":[38],"G'":[40],"EE').":[43],"Our":[44],"main":[45],"results":[46,105],"are":[47],"new":[49],"structural":[50],"theorems":[51],"for":[52,68,110,127],"optimal":[53],"solutions":[54],"V'-cut":[58,79,97,114],"when":[60],"planar.":[63],"first":[65,70,117],"theorem":[66,89,104],"establishes":[67,90],"time":[71,139],"close":[73],"connection":[74,92],"between":[75,93],"planar":[77,95,112],"well-known":[83],"\u201cGomory-Hu\u201d":[84],"cut":[85],"collections.":[86],"second":[88],"particular":[101],"matroid.":[102],"Each":[103],"simple":[108],"algorithm":[109,118,126],"problem.":[115],"based":[120],"upon":[121],"most":[123],"efficient":[124],"previous":[125],"this":[128],"(due":[130],"Dahlhaus":[132],"et":[133],"al.)":[134],"achieves":[136],"lower":[138],"complexity.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-08-02T14:50:37.381335","created_date":"2025-10-10T00:00:00"}