MULTIPLE-SOURCE MULTIPLE-SINK MAXIMUM FLOW IN DIRECTED PLANAR GRAPHS IN NEAR-LINEAR TIME

Glencora Borradaile,Philip N. Klein,Shay Mozes,Yahav Nussbaum,Christian Wulff-Nilsen

Foundations of Computer Science（2017）

引用 131|浏览0

暂无评分

摘要

We give an O(n log(3) n) algorithm that, given an n-node directed planar graph with arc capacities, a set of source nodes, and a set of sink nodes finds a maximum flow from the sources to the sinks. Previously, the fastest algorithms known for this problem were those for general graphs.

查看译文

关键词

planar graphs,maximum flow

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要