{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T06:41:01Z","timestamp":1698043261828},"reference-count":16,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6372,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An <jats:italic>exact cut<\/jats:italic> in a source\u2010sink network is a set of arcs which interesects each source\u2010sink path in exactly one arc. This paper investigates the problem of finding a maximum weight exact cut in a network. The problem is shown to be polynomially equivalent to that of determining the relevant arcs (arcs on at least one source\u2010sink path) in the network and is NP\u2010hard for general directed networks. There are, however, several important classes of network\u2014including undirected networks\u2014for which polynominal time algorithms do exist to solve the maximum weight exact cut problem.<\/jats:p>","DOI":"10.1002\/net.3230190303","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T02:49:09Z","timestamp":1178938149000},"page":"281-289","source":"Crossref","is-referenced-by-count":9,"title":["Exact cuts in networks"],"prefix":"10.1002","volume":"19","author":[{"given":"J. Scott","family":"Provan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. G.","family":"Kulkarni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.32.3.493"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.31.2.207"},{"key":"e_1_2_1_4_2","unstructured":"G. S.Fishman An alternative to the Monte Carlo estimation of network reliability Tech. Rep. UNC\/ORSA\/TR\u201083\/2. University of North Carolina Chapel Hill NC. 1983."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"e_1_2_1_7_2","volume-title":"Computers and Intractibility: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_8_2","unstructured":"A. V.Karazanov Determining the maximal flow in network with the method of preflows Soviet Math. Dokl. LS (1974)434\u2013437."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.5.769"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.33.6.1389"},{"key":"e_1_2_1_11_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70323-6"},{"key":"e_1_2_1_13_2","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitrious C. H.","year":"1982"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/322203.322207"},{"key":"e_1_2_1_15_2","unstructured":"C. E.Sigal The stochastic shortest route problem Ph.D. Dissertaion Purdue University."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-4754(79)90007-7"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1122"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T15:17:05Z","timestamp":1697987825000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["10.1002\/net.3230190303"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190303","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}