Linear-Time Algorithms For Max Flow And Multiple -Source Shortest Paths In Unit -Weight Planar Graphs

STOC（2013）

引用 38|浏览15

暂无评分

摘要

We give simple linear-time algorithms for two problems in planar graphs: max st-llow in directed graphs with unit capacities, and multiple -source shortest paths in undirected graphs with unit lengths.

查看译文

关键词

combinatorial optimization,planar graphs,max flow multiple -source shortest paths,Menger problem

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要