{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:39Z","timestamp":1725456999091},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032035","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"235-248","source":"Crossref","is-referenced-by-count":24,"title":["Can a maximum flow be computed in o(nm) time?"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Cheriyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torben","family":"Hagerup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974."},{"key":"19_CR2","unstructured":"R. K. Ahuja and J. B. Orlin, A Fast and Simple Algorithm for the Maximum Flow Problem, Sloan W.P. No. 1905-87 (revised), MIT, October 1988."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1137\/0218065","volume":"18","author":"R. K. Ahuja","year":"1989","unstructured":"R. K. Ahuja, J. B. Orlin and R. E. Tarjan, Improved Time Bounds for the Maximum Flow Problem, SIAM J. Comput. 18 (1989), pp. 939\u2013954.","journal-title":"SIAM J. Comput"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"N. Alon, Generating Pseudo-Random Permutations and Maximum Flow Algorithms, manuscript, December 1989.","DOI":"10.1016\/0020-0190(90)90024-R"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"J. Cheriyan and T. Hagerup, A Randomized Maximum-Flow Algorithm, Proceedings, 30th Annual Symposium on Foundations of Computer Science (1989), pp. 118\u2013123.","DOI":"10.1109\/SFCS.1989.63465"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"A. V. Goldberg and R. E. Tarjan, A New Approach to the Maximum-Flow Problem, J. ACM35 (1988), pp. 921\u2013940.","journal-title":"J. ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(82)90092-5","volume":"21","author":"L. M. Goldschlager","year":"1982","unstructured":"L. M. Goldschlager, R. A. Shaw and J. Staples, The Maximum Flow Problem is Log Space Complete for P, Theor. Comp. Sci.21 (1982), pp. 105\u2013111.","journal-title":"Theor. Comp. Sci."},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D. D. Sleator","year":"1985","unstructured":"D. D. Sleator and R. E. Tarjan, Self-Adjusting Binary Search Trees, J. ACM32 (1985), pp. 652\u2013686.","journal-title":"J. ACM"},{"key":"19_CR9","unstructured":"R. E. Tarjan, personal communication, September 1989."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:11Z","timestamp":1586612711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0032035","relation":{},"subject":[]}}