Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter*n*log(n)) Time

TL;DR

This paper introduces a novel algorithm for computing maximum flow in directed planar graphs with multiple sources and a single sink, achieving improved efficiency with an O(diameter * n * log(n)) runtime.

Contribution

The paper presents a new technique that significantly advances maximum flow computation in directed planar graphs with multiple sources, outperforming previous methods.

Findings

Achieves an O(diameter * n * log(n)) time complexity for the problem.

Introduces a novel technique deviating from traditional flow algorithms.

Provides theoretical improvements in maximum flow computation in planar graphs.

Abstract

We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniques for flow problems. This gives rise to an O(diameter*n*log(n)) algorithm for the problem.