About this document
Maximum Flow in Planar Graphs by ttungl is a document available to read on EtoBox.
The document presents a new algorithm for solving the maximum flow problem with multiple sources and sinks in directed planar graphs. The algorithm runs in near-linear O(n log3 n) time, which is a significant improvement over the previous best algorithms that took O(n2 log n) time by reducing the problem to the general graph case. The maximum flow problem with multiple sources and sinks arises in computer vision applications such as image segmentation. The new algorithm employs various graph algorithms and
- Author
- ttungl
- Language
- EN