3 citations · 15 across the 10 of their papers we have counts for
1 paper · 1 filter
Haim Kaplan, Yahav Nussbaum
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the a…