3 citations · 15 across the 10 of their papers we have counts for
1 paper · 2 filters
Yahav Nussbaum
In this paper we show an O(n^(3/2) log^2 n) time algorithm for finding a maximum flow in a planar graph with multiple sources and multiple sinks. This is the fastest algorithm whos…