91 citations · 167 across the 19 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
Boundary-to-boundary flows in planar graphs
Glencora Borradaile, Anna Harutyunyan
We give an iterative algorithm for finding the maximum flow between a set of sources and sinks that lie on the boundary of a planar graph. Our algorithm uses only O(n) queries to s…
cs.DS2013
Maximum st-flow in directed planar graphs via shortest paths
Glencora Borradaile, Anna Harutyunyan
Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to short…