2026-08-07T23:00:05Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:15505 2024-03-06T10:55:28Z ddc:004 open_access

A Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities Enoch, Julian Fox, Kyle Mesica, Dor Mozes, Shay flow planar graphs vertex capacities We give an O(k³ Δ n log n min(k, log² n) log²(nC))-time algorithm for computing maximum integer flows in planar graphs with integer arc and vertex capacities bounded by C, and k sources and sinks. This improves by a factor of max(k²,k log² n) over the fastest algorithm previously known for this problem [Wang, SODA 2019]. The speedup is obtained by two independent ideas. First we replace an iterative procedure of Wang that uses O(k) invocations of an O(k³ n log³ n)-time algorithm for maximum flow algorithm in a planar graph with k apices [Borradaile et al., FOCS 2012, SICOMP 2017], by an alternative procedure that only makes one invocation of the algorithm of Borradaile et al. Second, we show two alternatives for computing flows in the k-apex graphs that arise in our modification of Wang’s procedure faster than the algorithm of Borradaile et al. In doing so, we introduce and analyze a sequential implementation of the parallel highest-distance push-relabel algorithm of Goldberg and Tarjan [JACM 1988]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Julian Enoch and Kyle Fox and Dor Mesica and Shay Mozes 2021 Is Part Of LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2021.72 urn:nbn:de:0030-drops-155057 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.72 eng https://creativecommons.org/licenses/by/4.0/legalcode