Quantcast

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

Research paper by Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen

Indexed on: 21 Dec '17Published on: 01 Aug '17Published in: SIAM Journal on Computing



Abstract

SIAM Journal on Computing, Volume 46, Issue 4, Page 1280-1303, January 2017. We give an $O(n \log^3 n)$ algorithm that, given an $n$-node directed planar graph with arc capacities, a set of source nodes, and a set of sink nodes finds a maximum flow from the sources to the sinks. Previously, the fastest algorithms known for this problem were those for general graphs.