Single Source - All Sinks Max Flows in Planar Digraphs

Jakub Łącki, Yahav Nussbaum, Piotr Sankowski +1

Let G = (V,E) be a planar n-vertex digraph. Consider the problem of computing max st-flow values in G from a fixed source s to all sinks t in V\{s}. We show how to solve this probl…