{"id":"https://openalex.org/W1974602467","doi":"https://doi.org/10.1002/net.3230190303","title":"Exact cuts in networks","display_name":"Exact cuts in networks","publication_year":1989,"publication_date":"1989-05-01","ids":{"openalex":"https://openalex.org/W1974602467","doi":"https://doi.org/10.1002/net.3230190303","mag":"1974602467"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230190303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230190303","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/A5005781105","display_name":"J. Scott Provan","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Scott Provan","raw_affiliation_strings":["Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina","Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina#TAB#","institution_ids":["https://openalex.org/I114027177"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038542499","display_name":"V. G. Kulkarni","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. G. Kulkarni","raw_affiliation_strings":["Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina","Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Operations Research, University of North Carolina, Chapel Hill, North Carolina#TAB#","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.9902,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.89527787,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"3","first_page":"281","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9848999977111816,"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/sink","display_name":"Sink (geography)","score":0.6821753978729248},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.550453245639801},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5143073797225952},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.506508469581604},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.48415571451187134},{"id":"https://openalex.org/keywords/exact-solutions-in-general-relativity","display_name":"Exact solutions in general relativity","score":0.4687846899032593},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4381650686264038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42617303133010864},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.4239587187767029},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4045901298522949},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3776097297668457},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30865752696990967},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3070957660675049},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07763311266899109},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06940361857414246}],"concepts":[{"id":"https://openalex.org/C143050476","wikidata":"https://www.wikidata.org/wiki/Q194502","display_name":"Sink (geography)","level":2,"score":0.6821753978729248},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.550453245639801},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5143073797225952},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.506508469581604},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.48415571451187134},{"id":"https://openalex.org/C520416788","wikidata":"https://www.wikidata.org/wiki/Q5419229","display_name":"Exact solutions in general relativity","level":2,"score":0.4687846899032593},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4381650686264038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42617303133010864},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.4239587187767029},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4045901298522949},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3776097297668457},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30865752696990967},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3070957660675049},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07763311266899109},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06940361857414246},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","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},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230190303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230190303","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":15,"referenced_works":["https://openalex.org/W261886829","https://openalex.org/W1569458199","https://openalex.org/W1964119857","https://openalex.org/W1976285925","https://openalex.org/W1986361321","https://openalex.org/W2011039300","https://openalex.org/W2023059211","https://openalex.org/W2050757236","https://openalex.org/W2069323107","https://openalex.org/W2074329090","https://openalex.org/W2082060556","https://openalex.org/W2119702428","https://openalex.org/W2125690626","https://openalex.org/W2569646339","https://openalex.org/W4244424643"],"related_works":["https://openalex.org/W2129497110","https://openalex.org/W1572441411","https://openalex.org/W4289685524","https://openalex.org/W2885987986","https://openalex.org/W3208371434","https://openalex.org/W4225947064","https://openalex.org/W2977612001","https://openalex.org/W41039768","https://openalex.org/W2883647592","https://openalex.org/W1550549529"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"exact":[2,32,90],"cut":[3,33,91],"in":[4,18,34,59],"a":[5,9,29,35],"source\u2010sink":[6,16,57],"network":[7,61],"is":[8,39,63],"set":[10],"of":[11,27,47,75],"arcs":[12,51],"which":[13,79],"interesects":[14],"each":[15],"path":[17],"exactly":[19],"one":[20,56],"arc.":[21],"This":[22],"paper":[23],"investigates":[24],"the":[25,49,60,87],"problem":[26,38],"finding":[28],"maximum":[30,88],"weight":[31,89],"network.":[36],"The":[37],"shown":[40],"to":[41,45,85],"be":[42],"polynomially":[43],"equivalent":[44],"that":[46],"determining":[48],"relevant":[50],"(arcs":[52],"on":[53],"at":[54],"least":[55],"path)":[58],"and":[62],"NP\u2010hard":[64],"for":[65],"general":[66],"directed":[67],"networks.":[68],"There":[69],"are,":[70],"however,":[71],"several":[72],"important":[73],"classes":[74],"network\u2014including":[76],"undirected":[77],"networks\u2014for":[78],"polynominal":[80],"time":[81],"algorithms":[82],"do":[83],"exist":[84],"solve":[86],"problem.":[92]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}