{"id":"https://openalex.org/W2101400962","doi":"https://doi.org/10.1016/0304-3975(88)90028-x","title":"Min cut is NP-complete for edge weighted trees","display_name":"Min cut is NP-complete for edge weighted trees","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W2101400962","doi":"https://doi.org/10.1016/0304-3975(88)90028-x","mag":"2101400962"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(88)90028-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(88)90028-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5086678348","display_name":"Burkhard Monien","orcid":"https://orcid.org/0000-0003-2334-6795"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"B. Monien","raw_affiliation_strings":["Fachbereich Mathematik und Informatik, Universit\u00e4t Paderborn, 4790 Paderborn, Fed. Rep. Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Mathematik und Informatik, Universit\u00e4t Paderborn, 4790 Paderborn, Fed. Rep. Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061707475","display_name":"I. Hal Sudborough","orcid":"https://orcid.org/0000-0002-7192-9891"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I.H. Sudborough","raw_affiliation_strings":["Computer Science Department, University of Texas at Dallas, Richardson, TX 75083, U.S.A"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Texas at Dallas, Richardson, TX 75083, U.S.A","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086678348"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.6056,"has_fulltext":false,"cited_by_count":139,"citation_normalized_percentile":{"value":0.83835616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"58","issue":"1-3","first_page":"209","last_page":"229"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8329916000366211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7655214667320251},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.612292468547821},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.547379732131958},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.5382835865020752},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.48255056142807007},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4721812307834625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4666830003261566},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.45598721504211426},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.433595210313797},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4251467287540436},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4118942618370056},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2921651601791382},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11026373505592346}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8329916000366211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7655214667320251},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.612292468547821},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.547379732131958},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5382835865020752},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.48255056142807007},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4721812307834625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4666830003261566},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.45598721504211426},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.433595210313797},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4251467287540436},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4118942618370056},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2921651601791382},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11026373505592346},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(88)90028-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(88)90028-x","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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":31,"referenced_works":["https://openalex.org/W85690038","https://openalex.org/W177441241","https://openalex.org/W1587936952","https://openalex.org/W1980008391","https://openalex.org/W1998007106","https://openalex.org/W2011039300","https://openalex.org/W2014963708","https://openalex.org/W2015469394","https://openalex.org/W2022822152","https://openalex.org/W2030026014","https://openalex.org/W2038643780","https://openalex.org/W2053439155","https://openalex.org/W2054197381","https://openalex.org/W2056304107","https://openalex.org/W2062934582","https://openalex.org/W2063019820","https://openalex.org/W2066721455","https://openalex.org/W2074797580","https://openalex.org/W2076318470","https://openalex.org/W2097333141","https://openalex.org/W2137766675","https://openalex.org/W2143314829","https://openalex.org/W2162371997","https://openalex.org/W2509889156","https://openalex.org/W4248251133","https://openalex.org/W4300815182","https://openalex.org/W6635162972","https://openalex.org/W6658308639","https://openalex.org/W6663546308","https://openalex.org/W6669376042","https://openalex.org/W6680400994"],"related_works":["https://openalex.org/W2108770488","https://openalex.org/W2905360057","https://openalex.org/W3109770881","https://openalex.org/W4289237035","https://openalex.org/W2170923533","https://openalex.org/W2060380213","https://openalex.org/W2150488380","https://openalex.org/W3023249572","https://openalex.org/W2794618278","https://openalex.org/W2377239403"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}