{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:52:59Z","timestamp":1648810379536},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,29]],"date-time":"2008-10-29T00:00:00Z","timestamp":1225238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10852-008-9091-z","type":"journal-article","created":{"date-parts":[[2008,10,28]],"date-time":"2008-10-28T12:21:02Z","timestamp":1225196462000},"page":"19-34","source":"Crossref","is-referenced-by-count":0,"title":["Quick Max-flow Algorithm"],"prefix":"10.1007","volume":"8","author":[{"given":"Przemys\u0142aw","family":"Gordinowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,29]]},"reference":[{"key":"9091_CR1","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. Can. J. Math. 8, 399\u2013404 (1956)","journal-title":"Can. J. Math."},{"key":"9091_CR2","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"9091_CR3","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. Sov. Math. Dokl. 11, 1277\u20131280 (1970)","journal-title":"Sov. Math. Dokl."},{"key":"9091_CR4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvement in algorithmic efficienty for network flow problems. J. Assoc. Comput. Mach. 19, 248\u2013264 (1972)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9091_CR5","first-page":"434","volume":"15","author":"A.V. Karzanow","year":"1974","unstructured":"Karzanow, A.V.: Determining the maximal flow in a network by the method of pre-flows. Sov. Math. Dokl. 15, 434\u2013437 (1974)","journal-title":"Sov. Math. Dokl."},{"key":"9091_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0020-0190(78)90016-9","volume":"7","author":"V.M. Malhotra","year":"1978","unstructured":"Malhotra, V.M., Pramodh Kumar, M., Maheshwari, S.N.: An O(|V|3) algorithm for finding the maximum flows in network. Inf. Process. Lett. 7, 277\u2013278 (1978)","journal-title":"Inf. Process. Lett."},{"key":"9091_CR7","unstructured":"Goldberg, A.V.: Efficient graph algorithms for sequential and parallel computers. PhD thesis, Department of Electrical Engineering and Computer Science, MIT (1987)"},{"key":"9091_CR8","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT, Cambridge (1990)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9091-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-008-9091-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9091-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:30Z","timestamp":1559269590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-008-9091-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,29]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["9091"],"URL":"https:\/\/doi.org\/10.1007\/s10852-008-9091-z","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,29]]}}}