Maximum st-Flow in Directed Planar Graphs via Shortest Paths

机译：通过最短路径在有向平面图中的最大st-flow

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no constraints on the source and sink.

机译：在本文中，我们通过有向平面图中的对偶性给出了最大流量和最短路径之间的对应关系，而对源和汇没有限制。

著录项

来源
《International workshop on combinatorial algorithms》|2013年|423-427|共5页
会议地点
作者
Glencora Borradaile; Anna Harutyunyan;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. MINIMUM CUTS AND SHORTEST CYCLES IN DIRECTED PLANAR. GRAPHS VIA NONCROSSING SHORTEST PATHS [J] . Liang Hung-Chun, Lu Hsueh-I SIAM Journal on Discrete Mathematics . 2017,第1期

机译：定向平面中的最小切割次数和最短循环次数。通过最短路径的图形
2. Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs [J] . Ramaswamy R, Orlin JB, Chakravarti N Mathematical Programming . 2005,第2期

机译：无向图中最短路径和最大容量路径问题的灵敏度分析
3. Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs [J] . Ramkumar Ramaswamy, James B. Orlin, Nilopal Chakravarti Mathematical Programming . 2005,第2期

机译：无向图中最短路径和最大容量路径问题的灵敏度分析
4. Maximum st-Flow in Directed Planar Graphs via Shortest Paths [C] . Glencora Borradaile, Anna Harutyunyan International Workshop on Combinatorial Algorithms . 2013

机译：通过最短路径在指导的平面图中最大St-Flow
5. Shortest path - capacitated maximum covering problems. [D] . Hua, Liyan. 2010

机译：最短路径-容量最大的覆盖问题。
6. Detecting genetic association through shortest paths in a bi-directed graph [O] . Masao Ueki, Yoshinori Kawasaki, Gen Tamiya -1

机译：通过双向图中的最短路径检测遗传关联
7. Maximum st-flow in directed planar graphs via shortest paths [O] . Glencora Borradaile, Anna Harutyunyan 2016

机译：通过最短路径的定向平面图中的最大st-flow

Maximum st-Flow in Directed Planar Graphs via Shortest Paths

摘要

著录项

相似文献

相关主题

期刊订阅