An O(n log n) algorithm for maximum st-flow in a directed planar graph

被引：15

作者：

Borradaile, Glencora ^{[1
]}

Klein, Philip ^{[1
]}

机构：

[1] Brown Univ, Dept Comp Sci, Providence, RI 02912 USA

来源：

PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2006年

关键词：

D O I：

10.1145/1109557.1109615

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We give the first correct O(n log n) algorithm for finding a maximum st-flow in a directed planar graph. After a preprocessing step that consists in finding single-source shortest-path distances in the dual, the algorithm consists of repeatedly saturating the leftmost residual s-to-t path.

引用

页码：524 / 533

页数：10

共 50 条

[21] Shortest Paths in Directed Planar Graphs with Negative Lengths: A Linear-Space O(n log2 n)-Time Algorithm
Klein, Philip N.
Mozes, Shay
Weimann, Oren
ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
[22] (O)over-tilde(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability
Asano, Tetsuo
Kirkpatrick, David
Nakagawa, Kotaro
Watanabe, Osamu
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II, 2014, 8635 : 45 - 56
[23] AN O(N2LOG N) PARALLEL MAX-FLOW ALGORITHM
SHILOACH, Y
VISHKIN, U
JOURNAL OF ALGORITHMS, 1982, 3 (02) : 128 - 146
[24] AN O(M LOG N)-TIME ALGORITHM FOR THE MAXIMAL PLANAR SUBGRAPH PROBLEM
CAI, JZ
HAN, XF
TARJAN, RE
SIAM JOURNAL ON COMPUTING, 1993, 22 (06) : 1142 - 1162
[25] A RANDOMIZED ALGORITHM FOR FINDING MAXIMUM WITH O((LOG N)(2)) POLYNOMIAL TESTS
TING, HF
YAO, AC
INFORMATION PROCESSING LETTERS, 1994, 49 (01) : 39 - 43
[26] An O(N log N) algorithm for shape modeling
Malladi, R.
Sethian, J. A.
Proceedings of the National Academy of Sciences of the United States of America, 93 (18):
[27] AN O(N LOG N) MANHATTAN PATH ALGORITHM
LIPSKI, W
INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 99 - 102
[28] An O(N log N) algorithm for shape modeling
Malladi, R
Sethian, JA
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (18) : 9389 - 9392
[29] An O(n log n) algorithm for the all-farthest-segments problem for a planar set of points
Drysdale, R. L. Scot
Mukhopadhyay, Asish
INFORMATION PROCESSING LETTERS, 2007, 105 (02) : 47 - 51
[30] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Peng, Z. S.
Ting, H. F.
INFORMATION PROCESSING LETTERS, 2006, 100 (04) : 137 - 144

← 1 2 3 4 5 →