{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,14]],"date-time":"2026-11-14T02:13:34Z","timestamp":1794622414168,"version":"4.9.1"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,1,23]],"date-time":"2022-01-23T00:00:00Z","timestamp":1642896000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US Department of Energy\u2019s National Nuclear Security Administration","award":["DE-NA0003525"],"award-info":[{"award-number":["DE-NA0003525"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2022,1,31]]},"abstract":"<jats:p>\n            We consider the maximum flow problem in directed planar graphs with capacities on both vertices and arcs and with multiple sources and sinks. We present three algorithms when the capacities are integers. The first algorithm runs in\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>min<\/jats:italic>\n            {\n            <jats:italic>k<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            <jats:italic>n<\/jats:italic>\n            ,\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:sup>3<\/jats:sup>\n            <jats:italic>n<\/jats:italic>\n            +\n            <jats:italic>kn<\/jats:italic>\n            }) time when all capacities are bounded by a constant, where\n            <jats:italic>n<\/jats:italic>\n            is the number of vertices in the graph, and\n            <jats:italic>k<\/jats:italic>\n            is the number of terminals. This algorithm is the first to solve the vertex-disjoint paths problem in linear time when\n            <jats:italic>k<\/jats:italic>\n            is fixed but larger than 2. The second algorithm runs in\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>k<\/jats:italic>\n            <jats:sup>5<\/jats:sup>\n            \u0394\n            <jats:italic>n<\/jats:italic>\n            polylog (\n            <jats:italic>nU<\/jats:italic>\n            )) time, where each arc capacity and finite vertex capacity is bounded by\n            <jats:italic>U<\/jats:italic>\n            , and \u0394 is the maximum degree of the graph. Finally, when\n            <jats:italic>k<\/jats:italic>\n            = 3, we present an algorithm that runs in\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            ) time; this algorithm works even when the capacities are arbitrary reals. Our algorithms improve on the fastest previously known algorithms when\n            <jats:italic>k<\/jats:italic>\n            and \u0394 are fixed and\n            <jats:italic>U<\/jats:italic>\n            is bounded by a polynomial in\n            <jats:italic>n<\/jats:italic>\n            . Prior to this result, the fastest algorithms ran in\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\n              4\/3+\n              <jats:italic>o<\/jats:italic>\n              (1)\n            <\/jats:sup>\n            ) time for unit capacities; in the smallest of\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>3\/2<\/jats:sup>\n            log\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>U<\/jats:italic>\n            ), \u00d5(\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>10\/7<\/jats:sup>\n            <jats:italic>U<\/jats:italic>\n            <jats:sup>1\/7<\/jats:sup>\n            ),\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>11\/8+o(1)<\/jats:sup>\n            <jats:italic>U<\/jats:italic>\n            <jats:sup>1\/4<\/jats:sup>\n            ), and\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>4\/3 + o(1)<\/jats:sup>\n            <jats:italic>U<\/jats:italic>\n            <jats:sup>1\/3<\/jats:sup>\n            ) time for integer capacities; and in\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            \/log\n            <jats:italic>n<\/jats:italic>\n            ) time for real capacities, even when\n            <jats:italic>k<\/jats:italic>\n            = 3.\n          <\/jats:p>","DOI":"10.1145\/3504032","type":"journal-article","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T05:51:05Z","timestamp":1643003465000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Max Flows in Planar Graphs with Vertex Capacities"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4155-8468","authenticated-orcid":false,"given":"Yipu","family":"Wang","sequence":"first","affiliation":[{"name":"Sandia National Laboratories, Albuquerque, New Mexico"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,1,23]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.73"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502798"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010029"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921665"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488702"},{"key":"e_1_3_3_7_2","first-page":"72:1\u201372:16","volume-title":"Proceedings of the 32nd International Symposium on Algorithms and Computation","author":"Enoch Julian","year":"2021","unstructured":"Julian Enoch, Kyle Fox, Dor Mesica, and Shay Mozes. 2021. A faster algorithm for maximum flow in directed planar graphs with vertex capacities. In Proceedings of the 32nd International Symposium on Algorithms and Computation. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 72:1\u201372:16. DOI:DOI:https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2021.72"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873666"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/140901.141935"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"key":"e_1_3_3_13_2","unstructured":"Donggu Kang and James Payor. 2015. Flow Rounding. (2015). arxiv:cs.DS\/1507.08139. Retrieved from https:\/\/arxiv.org\/abs\/1507.08139."},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.5555\/2616915.2617866"},{"key":"e_1_3_3_15_2","first-page":"119","volume-title":"Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science","author":"Kathuria Tarun","year":"2020","unstructured":"Tarun Kathuria, Yang P. Liu, and Aaron Sidford. 2020. Unit capacity maxflow in almost O(m^{4\/3}) time. In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, Los Alamitos, CA, 119\u2013130. DOI:DOI:https:\/\/doi.org\/10.1109\/FOCS46700.2020.00020"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/0406038"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01240733"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.4064\/fm-15-1-271-283"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384247"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539789162997"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.70"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310470"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69733-6_57"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.5555\/1226009.1226014"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3504032","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3504032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:45:06Z","timestamp":1750268706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3504032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,23]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,31]]}},"alternative-id":["10.1145\/3504032"],"URL":"https:\/\/doi.org\/10.1145\/3504032","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,23]]},"assertion":[{"value":"2019-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}