{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:52:29Z","timestamp":1775065949747,"version":"3.50.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2014,8]]},"abstract":"<jats:p>Though maximum flow algorithms have a long history, revolutionary progress is still being made.<\/jats:p>","DOI":"10.1145\/2628036","type":"journal-article","created":{"date-parts":[[2014,7,24]],"date-time":"2014-07-24T15:46:18Z","timestamp":1406216778000},"page":"82-89","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":87,"title":["Efficient maximum flow algorithms"],"prefix":"10.1145","volume":"57","author":[{"given":"Andrew V.","family":"Goldberg","sequence":"first","affiliation":[{"name":"Microsoft Research Silicon Valley Lab, Mountain View, CA"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ"}]}],"member":"320","published-online":{"date-parts":[[2014,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Ahuja R.K. Magnanti T.L. and Orlin J.B. Network Flows: Theory Algorithms and Applications. Prentice-Hall Inc. Upper Saddle River NJ 1993.   Ahuja R.K. Magnanti T.L. and Orlin J.B. Network Flows: Theory Algorithms and Applications . Prentice-Hall Inc. Upper Saddle River NJ 1993."},{"key":"e_1_2_1_2_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the Sixth Workshop on Experimental Algorithms","author":"Babenko M.A.","year":"2007"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502798"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.73"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218072"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009180"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993674"},{"key":"e_1_2_1_9_1","first-page":"373","article-title":"Application of the simplex method to a transportation problem. In Activity Analysis and Production and Allocation, T.C. Koopmans, Ed. John Wiley & Sons, Inc","volume":"359","author":"Dantzig G.B","year":"1951","journal-title":"New York"},{"key":"e_1_2_1_10_1","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"Dinic E.A","year":"1970","journal-title":"Soviet Mathematical Docladi"},{"key":"e_1_2_1_11_1","volume-title":"Matematike Nauka","author":"Dinic E.A.","year":"1973"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204043"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90035-5"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02158-9_19"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.15.3.430"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040572.2040623"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276714"},{"key":"e_1_2_1_22_1","first-page":"66","article-title":"Tochnaya otzenka algoritma nakhojdeniya maksimalnogo potoka, primenennogo k aadache 'o predstavitelyakh' {The exact time bound for a maximum flow algorithm applied to the set representatives problem}","volume":"5","author":"Karzanov A.V","year":"1973","journal-title":"Problems in Cibernetics"},{"key":"e_1_2_1_23_1","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov A.V","year":"1974","journal-title":"Soviet Mathematical Dokladi"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634090"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488704"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.36"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_55"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2628036","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2628036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:38Z","timestamp":1750231178000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2628036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":31,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["10.1145\/2628036"],"URL":"https:\/\/doi.org\/10.1145\/2628036","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8]]},"assertion":[{"value":"2014-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}