{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:31Z","timestamp":1725662911008},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108566"},{"type":"electronic","value":"9783540387695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10856-4_106","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:33:25Z","timestamp":1330191205000},"page":"389-397","source":"Crossref","is-referenced-by-count":1,"title":["The maximum k-flow in a network"],"prefix":"10.1007","author":[{"given":"V\u00e1clav","family":"Koubek","sequence":"first","affiliation":[]},{"given":"Anton\u00edn","family":"\u0158\u00edha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"4","key":"37_CR1","first-page":"661","volume":"12","author":"J. Ad\u00e1mek","year":"1971","unstructured":"Ad\u00e1mek, J. and Koubek, V., Remarks on flows in network with short paths. CMUC 12, 4(1971), 661\u2013667.","journal-title":"CMUC"},{"key":"37_CR2","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"Dinic, E.A., Algorithm for solution of a problem of maximal flow in a network with power estimation. Soviet Math. Dokl. 11(1970), 1277\u20131280.","journal-title":"Soviet Math. Dokl."},{"key":"37_CR3","volume-title":"Flows in networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R. and Fulkerson, D.R., Flows in networks. Princeton University, New Jersey, 1962."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Galil, Z., A new algorithm for the maximal flow problem. Proc.19th IEEE Symp. on Found. Comp. Sci., Ann-Arbor, Mich., October 1978, 231\u2013245.","DOI":"10.1109\/SFCS.1978.5"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Galil, Z. and Naamad, A., Network flow and generalized path compression. Proc. 11th ACM Symp. on Theory of Comp., 1979, 13\u201326.","DOI":"10.1145\/800135.804394"},{"key":"37_CR6","first-page":"434","volume":"15","author":"A.V. Karzanov","year":"1974","unstructured":"Karzanov, A.V., Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl. 15(1974), 434\u2013437.","journal-title":"Soviet Math. Dokl."},{"issue":"4","key":"37_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02019432","volume":"9","author":"L. Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L., Neumann-Lara, V. and Plummer, M., Mengerian theorems for paths of bounded length. Perlodica Math. Hungarica, Vol.9(4), 1978, 269\u2013276.","journal-title":"Perlodica Math. Hungarica"},{"key":"37_CR8","first-page":"1","volume-title":"Recent developments in the complexity of combinatorial algorithms","author":"R.E. Tarjan","year":"1980","unstructured":"Tarjan, R.E., Recent developments in the complexity of combinatorial algorithms. Proc. 5th IBM Symp. on MFCS, IBM Japan, 1980, 1\u201328."},{"key":"37_CR9","volume-title":"Potokovyje algoritmy","author":"G.M. Adelson-Velskij","year":"1975","unstructured":"Adelson-Velskij, G.M., Dinic, E.A. and Karzanov, A.V., Potokovyje algoritmy\/in Russian\/.Nauka, Moskva, 1975."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1981"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10856-4_106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:39:56Z","timestamp":1619555996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10856-4_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108566","9783540387695"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-10856-4_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}