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 条

[11] An O(log n log log n) space algorithm for undirected st-connectivity
Trifonov, Vladimir
SIAM JOURNAL ON COMPUTING, 2008, 38 (02) : 449 - 483
[12] AN O(N LOG N + M LOG LOG N) MAXIMUM WEIGHT CLIQUE ALGORITHM FOR CIRCULAR-ARC GRAPHS
SHIH, WK
HSU, WL
INFORMATION PROCESSING LETTERS, 1989, 31 (03) : 129 - 134
[13] An O(n(log n)3) algorithm for maximum matching in trapezoid graphs
Ngoc-Khang Le
Phan-Thuan Do
PROCEEDINGS OF 2013 IEEE RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES: RESEARCH, INNOVATION, AND VISION FOR THE FUTURE (RIVF), 2013, : 157 - 162
[14] An O(n√n, log log n) average case algorithm for the maximum induced matching problem in permutation graphs
Viet Cuong Than
Phan Thuan Do
PROCEEDINGS OF THE 2018 5TH ASIAN CONFERENCE ON DEFENSE TECHNOLOGY (ACDT 2018), 2018, : 45 - 49
[15] Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time
Wulff-Nilsen, Christian
PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 756 - 765
[16] An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
Cole, R
Colton, MF
Hariharan, R
Przytycka, T
Thorup, M
SIAM JOURNAL ON COMPUTING, 2000, 30 (05) : 1385 - 1404
[17] AN O(N LOG2N) ALGORITHM FOR THE MAXIMUM WEIGHTED TARDINESS PROBLEM
HOCHBAUM, DS
SHAMIR, R
INFORMATION PROCESSING LETTERS, 1989, 31 (04) : 215 - 219
[18] An O(n log n) algorithm for the Maximum Agreement Subtree problem for binary trees
Cole, R
Hariharan, R
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 323 - 332
[19] An O (n(log n)2/log log n) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees
Spoerhase, J.
Wirth, H. -C.
INFORMATION PROCESSING LETTERS, 2009, 109 (08) : 391 - 394
[20] Shortest Paths in Directed Planar Graphs with Negative Lengths: a Linear-Space O(n log2 n)-Time Algorithm
Klein, Philip
Mozes, Shay
Weimann, Oren
PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 236 - +

← 1 2 3 4 5 →