{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:01:38Z","timestamp":1742400098862},"reference-count":16,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We establish that finding a minimum cut or a maximum flow in an acyclic network is no easier than the corresponding problem on a general network.<\/jats:p>","DOI":"10.1002\/net.3230170403","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:20:51Z","timestamp":1178922051000},"page":"387-392","source":"Crossref","is-referenced-by-count":10,"title":["The complexity of minimum cut and maximum flow problems in an acyclic network"],"prefix":"10.1002","volume":"17","author":[{"given":"Vijaya","family":"Ramachandran","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80041-3"},{"key":"e_1_2_1_3_2","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"Dinic E. A.","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_4_2","volume-title":"Graph Algorithms","author":"Even S.","year":"1979"},{"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":"crossref","unstructured":"A. V.GoldbergandR. E.Tarjan A new approach to the maximum flow problem 18th Ann. ACM Symp. on Theory of Computing Berkeley CA May1986 pp.136\u2013146.","DOI":"10.1145\/12130.12144"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90092-5"},{"key":"e_1_2_1_8_2","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov A. V.","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"R. M.Karp E.Upfal andA.Wigderson Constructing a perfect matching is in RNC Proc. 17th Ann. Symp. on Theory of Computing Providence RI May1985 pp.22\u201332.","DOI":"10.1145\/22145.22148"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90016-9"},{"key":"e_1_2_1_11_2","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1982"},{"key":"e_1_2_1_12_2","volume-title":"Finding a minimum feedback arc set in a reducible flow graph preprint","author":"Ramachandran V.","year":"1985"},{"key":"e_1_2_1_13_2","unstructured":"V.Ramachandran Fast parallel algorithms for reducible flow graphs. Manuscript in preparation."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90020-7"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/0208051"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170403","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T03:53:49Z","timestamp":1697860429000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170403"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170403","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}