{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:32Z","timestamp":1725662912843},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_109","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:33:37Z","timestamp":1330191217000},"page":"418-422","source":"Crossref","is-referenced-by-count":1,"title":["Maximum flow in planar networks"],"prefix":"10.1007","author":[{"given":"Lud\u011bk","family":"Ku\u010dera","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"40_CR1","unstructured":"Berge, C., Ghouila-Houri, A., Programming, Games and Transportation networks, Methuen, Agincourt, Ontario."},{"key":"40_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":"40_CR3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R. and Fulkerson, D.R., Maximal flow through a network, Canad. J.Math., 8 (1956), 399\u2013404.","journal-title":"Canad. J.Math."},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0208012","volume":"8","author":"A. Itai","year":"1979","unstructured":"Itai, A. and Shiloach, Y., Maximum flow in planar networks, SIAM J. Comput. 8 (1979), 135\u2013150.","journal-title":"SIAM J. Comput."},{"key":"40_CR5","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."},{"key":"40_CR6","volume-title":"Recent developments in the complexity of combinatorial algorithms","author":"R.E. Tarjan","year":"1974","unstructured":"Tarjan, R.E., Recent developments in the complexity of combinatorial algorithms, Proc. Fifth IBM Symp. on Mathematical Foundations of Computer Science, Hakone Yama no Hotel, Japan, 1974."},{"key":"40_CR7","unstructured":"Sleator, D. and Tarjan, R.E., An O(nm log n) algorithm for maximum network flows, submitted."}],"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_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:39:57Z","timestamp":1619555997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10856-4_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108566","9783540387695"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-10856-4_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}