3 citations · 7 across the 5 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DM2010★ 1 cited
Multiple-source multiple-sink maximum flow in planar graphs
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…
cs.DS2010★ 2 cited
Improved distance queries in planar graphs
Yahav Nussbaum
There are several known data structures that answer distance queries between two arbitrary vertices in a planar graph. The tradeoff is among preprocessing time, storage space and q…