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 条

[1] An O(n log n) Algorithm for Maximum st-Flow in a Directed Planar Graph
Borradaile, Glencora
Klein, Philip
JOURNAL OF THE ACM, 2009, 56 (02)
[2] AN O(N LOG2 N) ALGORITHM FOR MAXIMUM FLOW IN UNDIRECTED PLANAR NETWORKS
HASSIN, R
JOHNSON, DB
SIAM JOURNAL ON COMPUTING, 1985, 14 (03) : 612 - 624
[3] An O(n log log n) time algorithm for constructing a graph of maximum connectivity with prescribed degrees
Asano, T
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (03) : 503 - 510
[4] Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter . n log n) Time
Klein, Philip N.
Mozes, Shay
ALGORITHMS AND DATA STRUCTURES, 2011, 6844 : 571 - +
[5] Minimum Cut of Directed Planar Graphs in O(n log log n) Time
Mozes, Shay
Nikolaev, Kirill
Nussbaum, Yahav
Weimann, Oren
SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 477 - 494
[6] A O(nm log(U/n)) time maximum flow algorithm
Sedeño-Noda, A
González-Martín, C
NAVAL RESEARCH LOGISTICS, 2000, 47 (06) : 511 - 520
[7] COMPUTING THE GIRTH OF A PLANAR GRAPH IN O(n log n) TIME
Weimann, Oren
Yuster, Raphael
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (02) : 609 - 616
[8] Computing the Girth of a Planar Graph in O (n log n) Time
Weimann, Oren
Yuster, Raphael
AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 764 - +
[9] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
KIM, T
CHWA, KY
INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
[10] A simple O(n log n) algorithm for finding the maximum distance between two finite planar sets
Toussaint, Godfried T.
McAlear, Jim A.
PATTERN RECOGNITION LETTERS, 1982, 1 (01) : 21 - 24

← 1 2 3 4 5 →