{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T13:38:00Z","timestamp":1772372280713,"version":"3.50.1"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0635089"],"award-info":[{"award-number":["CCF-0635089"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2009,4]]},"abstract":"<jats:p>\n            We give the first correct\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            ) algorithm for finding a maximum\n            <jats:italic>st<\/jats:italic>\n            -flow in a directed planar graph. After a preprocessing step that consists in finding single-source shortest-path distances in the dual, the algorithm consists of repeatedly saturating the leftmost residual\n            <jats:italic>s<\/jats:italic>\n            -to-\n            <jats:italic>t<\/jats:italic>\n            path.\n          <\/jats:p>","DOI":"10.1145\/1502793.1502798","type":"journal-article","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T13:37:07Z","timestamp":1239802627000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":60,"title":["An\n            <i>O<\/i>\n            (\n            <i>n<\/i>\n            log\n            <i>n<\/i>\n            ) algorithm for maximum\n            <i>st<\/i>\n            -flow in a directed planar graph"],"prefix":"10.1145","volume":"56","author":[{"given":"Glencora","family":"Borradaile","sequence":"first","affiliation":[{"name":"Brown University, Providence, Rhode Island"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip","family":"Klein","sequence":"additional","affiliation":[{"name":"Brown University, Providence, Rhode Island"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,4,17]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM","author":"Acar U."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103963.1103966"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science. Springer-Verlag","author":"Biedl T."},{"key":"e_1_2_1_4_1","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"Dinitz E.","year":"1970","journal-title":"Sov. Math. Dokl."},{"key":"e_1_2_1_5_1","first-page":"646","article-title":"A combinatorial representation for polyhedral surfaces","volume":"7","author":"Edmonds J.","year":"1960","journal-title":"Notices AMS"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056816"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. ACM","author":"Eppstein D."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 42th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press","author":"Fakcharoenphol J."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_2_1_12_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 6th Scandinavian Workshop on Algorithm Theory","author":"Goldberg A."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_2_1_15_1","unstructured":"Harris T. and Ross F. 1955. Fundamentals of a method for evaluating rail net capacities. Research Memorandum RM-1573 The RAND Corporation Santa Monica CA.  Harris T. and Ross F. 1955. Fundamentals of a method for evaluating rail net capacities. Research Memorandum RM-1573 The RAND Corporation Santa Monica CA."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90120-4"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214045"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01203357"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320215"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208012"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 20th Annual Allerton Conference on Communication, Control, and Computing. 898--905","author":"Johnson D. B."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01240733"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0406038"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM","author":"Klein P. N.","year":"2005"},{"key":"e_1_2_1_27_1","unstructured":"Kotzig A. 1956. S\u00favislos\u0165 a pravideln\u00e1 s\u00favislos\u0165 kone\u010dn\u00fdch grafov. Ph.D. dissertation Vysok\u00e1 \u0160kola Ekonomick\u00e1 Bratislava.  Kotzig A. 1956. S\u00favislos\u0165 a pravideln\u00e1 s\u00favislos\u0165 kone\u010dn\u00fdch grafov. Ph.D. dissertation Vysok\u00e1 \u0160kola Ekonomick\u00e1 Bratislava."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539789162997"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212005"},{"key":"e_1_2_1_30_1","volume-title":"Eds. DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume":"20","author":"Ripphausen-Lipa H."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100259"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_2_1_33_1","unstructured":"Sommerville D. 1929. An introduction to the geometry of n dimensions. London.  Sommerville D. 1929. An introduction to the geometry of n dimensions. London."},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM","author":"Tarjan R."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1538"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Whitney H. 1933. Planar graphs. Fundamenta mathematicae 21 73--84.  Whitney H. 1933. Planar graphs. Fundamenta mathematicae 21 73--84.","DOI":"10.4064\/fm-21-1-73-84"},{"key":"e_1_2_1_37_1","first-page":"303","article-title":"Minimal imbeddings and the genus of a graph","volume":"12","author":"Youngs J.","year":"1963","journal-title":"J. Math. Mech."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1502793.1502798","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1502793.1502798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:37Z","timestamp":1750253377000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1502793.1502798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["10.1145\/1502793.1502798"],"URL":"https:\/\/doi.org\/10.1145\/1502793.1502798","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4]]},"assertion":[{"value":"2006-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-04-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}