Multiple source, single sink maximum flow in a planar graph
classification
💻 cs.DM
cs.DS
keywords
algorithmflowgraphmaximummultipleplanarsinglesink
read the original abstract
We give an $O(n^{1.5}\log n)$ time algorithm for finding the maximum flow in a directed planar graph with multiple sources and a single sink. The techniques generalize to a subquadratic time algorithm for bounded genus graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.