{"id":"https://openalex.org/W2955437773","doi":"https://doi.org/10.1002/net.3230170403","title":"The complexity of minimum cut and maximum flow problems in an acyclic network","display_name":"The complexity of minimum cut and maximum flow problems in an acyclic network","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2955437773","doi":"https://doi.org/10.1002/net.3230170403","mag":"2955437773"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170403","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170403","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5044018198","display_name":"Vijaya Ramachandran","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vijaya Ramachandran","raw_affiliation_strings":["College of Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801"],"affiliations":[{"raw_affiliation_string":"College of Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044018198"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.0314,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.78339662,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"17","issue":"4","first_page":"387","last_page":"392"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9990000128746033,"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.9972000122070312,"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/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6593772768974304},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5703651905059814},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5659815073013306},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.548332691192627},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5092960596084595},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.4839463531970978},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4513491690158844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4243679642677307},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4219365119934082},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35679566860198975},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09643390774726868}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6593772768974304},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5703651905059814},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5659815073013306},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.548332691192627},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5092960596084595},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.4839463531970978},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4513491690158844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4243679642677307},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4219365119934082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35679566860198975},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09643390774726868}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170403","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170403","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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":13,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1964119857","https://openalex.org/W1975146994","https://openalex.org/W2017205387","https://openalex.org/W2018078086","https://openalex.org/W2018804864","https://openalex.org/W2050620052","https://openalex.org/W2059378738","https://openalex.org/W2069323107","https://openalex.org/W2081013866","https://openalex.org/W2123806189","https://openalex.org/W2956049318","https://openalex.org/W4244424643"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W2080904092","https://openalex.org/W3141113327","https://openalex.org/W2401819591","https://openalex.org/W4311255633","https://openalex.org/W3159013657","https://openalex.org/W2381207282","https://openalex.org/W89936677","https://openalex.org/W314376252","https://openalex.org/W2154501376"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"establish":[2],"that":[3],"finding":[4],"a":[5,9,24],"minimum":[6],"cut":[7],"or":[8],"maximum":[10],"flow":[11],"in":[12],"an":[13],"acyclic":[14],"network":[15],"is":[16],"no":[17],"easier":[18],"than":[19],"the":[20],"corresponding":[21],"problem":[22],"on":[23],"general":[25],"network.":[26]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}