{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:14:06Z","timestamp":1725459246380},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540133720"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030319","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:19:29Z","timestamp":1138184369000},"page":"370-377","source":"Crossref","is-referenced-by-count":1,"title":["Finding a maximum flow in \/s,t\/-planar network in linear expected time"],"prefix":"10.1007","author":[{"given":"L.","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Berge,C., Ghouila-Houri,A. Programming, Games and Transportation Networks, Methuen, Agincourt, Ontario."},{"key":"34_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":"34_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.,Fulkerson, D.R. Maximal flow through a network. Canad.J.Math. 8 \/1956\/, 399\u2013404.","journal-title":"Canad.J.Math."},{"key":"34_CR4","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R.,Fulkerson, D.R. Flows in Networks. Princeton University Press, New Jersey, 1962."},{"issue":"3","key":"34_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(81)90120-4","volume":"13","author":"R. Hassin","year":"1981","unstructured":"Hassin, R. Maximum flow in \/s,t\/-planar networks. Info.Proc.Letters, 13,3 \/1981\/, 107.","journal-title":"Info.Proc.Letters"},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0208012","volume":"8","author":"A. Itai","year":"1979","unstructured":"Itai, A.,Shiloach, Y. Maximum flow in planar networks. SIAM J.COmput. 8 \/1979\/,135\u2013150.","journal-title":"SIAM J.COmput."},{"key":"34_CR7","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":"34_CR8","volume-title":"The Art of Computer Programming. Vol.1.Basic Algorithms. Vol.3.Sorting and Searching","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E. The Art of Computer Programming. Vol.1.Basic Algorithms. Vol.3.Sorting and Searching. Addison-Wesley, Reading, 1968 and 1973."},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1007\/3-540-10856-4_109","volume-title":"Mathematical Foundation of Computer Science","author":"L. Ku\u010dera","year":"1981","unstructured":"Ku\u010dera, L. Maximum flow in planar networks. In Mathematical Foundation of Computer Science.Gruska, J. and Chytil, M.eds.,Lecture Notes in Computer Science 118, Springer Verlag, Berlin, 1981, 418\u2013422."},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"The Design of Dynamic Data Structure","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H. The Design of Dynamic Data Structure, Lecture Notes in Computer Science 158, Springer Verlag, Berlin, 1983."},{"key":"34_CR11","unstructured":"Sleator,D,D. An O(nm log n) algorithm for maximum network flow. Ph.D.Thesis, Stanford Univ., 1980."},{"key":"34_CR12","series-title":"Lecture Noters in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/3-540-10856-4_124","volume-title":"Mathematical Foundation of Computer Science","author":"J. Wiederman","year":"1981","unstructured":"Wiederman, J. Preserving total order in constant expected time. In Mathematical Foundation of Computer Science, Gruska, J. and Chytil, M. eds., Lecture Noters in Computer Science 118, Springer Verlag, Berlin, 1981, 554\u2013562."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1984"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030319.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:01:04Z","timestamp":1607533264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030319"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540133720"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0030319","relation":{},"subject":[]}}