{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:29Z","timestamp":1725663209232},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187400"},{"type":"electronic","value":"9783540481386"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18740-5_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:42:37Z","timestamp":1330198957000},"page":"82-91","source":"Crossref","is-referenced-by-count":0,"title":["Saturating flows in networks"],"prefix":"10.1007","author":[{"given":"B. S.","family":"Chlebus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Diks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0166-218X(85)90006-X","volume":"10","author":"W.W. Bein","year":"1985","unstructured":"W.W. Bein, P. Brucker, and A. Tamir, Minimum cost flow algorithms for series-parallel networks, Discr. Appl. Math. 10 (1985), 117\u2013124.","journal-title":"Discr. Appl. Math."},{"key":"22_CR2","unstructured":"M. Chrobak, and K. Diks, Network flows in outerplanar networks, submitted."},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A, Itai, and A. Shamir, On the complexity of timetable and multicomodity flow problems, SIAM J. Computing 5 (1976), 691\u2013703.","journal-title":"SIAM J. Computing"},{"key":"22_CR4","first-page":"399","volume":"4","author":"S. Even","year":"1975","unstructured":"S. Even, and R.E. Tarjan, Network flow and testing graph connectivity, SIAM J. Computing 4 (1975), 399\u2013404.","journal-title":"SIAM J. Computing"},{"key":"22_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey, and D.S. Johnson, \"Computers and Intractability: A Guide to the Theory of NP-Completeness,\" W.H. Freeman, San Francisco, 1979."},{"key":"22_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0196-6774(83)90024-X","volume":"4","author":"T.C. Hu","year":"1983","unstructured":"T.C. Hu, and M.T. Shing, Multiterminal flows in outerplanar networks, J. Algorithms 4 (1983), 241\u2013261.","journal-title":"J. Algorithms"},{"key":"22_CR7","unstructured":"A. Itai, Two-commodity flow, Rep. No 93, Dept. of Comput. Sci., Technion, Haifa, Israel."},{"key":"22_CR8","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler, \"Combinatorial Optimization: Networks and Matroids,\" Holt, Rinehart and Winston, New York, 1976."},{"key":"22_CR9","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou, and K. Steiglitz, \"Combinatorial Optimization: Algorithms and Complexity,\" Prentice-Hall, Englewood Cliffs, New York, 1982."},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"S. Sahni, Computationally related problems, SIAM J. Computing 3 (1974), 262\u2013279.","journal-title":"SIAM J. Computing"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(79)90060-8","volume":"26","author":"M.M. Syslo","year":"1979","unstructured":"M.M. Syslo, Characterizations of outerplanar graphs, Disc. Math. 26 (1979), 47\u201353.","journal-title":"Disc. Math."},{"key":"22_CR12","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan, \"Data Structures and Network Algorithms,\" SIAM, Philadelfia, Pennsylvania, 1983."},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R.E. Tarjan, and E.L. Lawler, The recognition of series-parallel networks, SIAM J. Computing 11 (1982), 298\u2013313.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18740-5_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:17:25Z","timestamp":1619558245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18740-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187400","9783540481386"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-18740-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}