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 条
  • [31] An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width
    Gluchshenko, Olga N.
    Hamacher, Horst W.
    Tamir, Arie
    OPERATIONS RESEARCH LETTERS, 2009, 37 (03) : 168 - 170
  • [32] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
    Peng, ZS
    Ting, HF
    ALGORITHMS AND COMPUTATION, 2004, 3341 : 754 - 765
  • [33] PLANAR DEPTH-1ST SEARCH IN O(LOG N) PARALLEL TIME
    HAGERUP, T
    SIAM JOURNAL ON COMPUTING, 1990, 19 (04) : 678 - 704
  • [34] An o(n(3))-time maximum-flow algorithm
    Cheriyan, J
    Hagerup, T
    Mehlhorn, K
    SIAM JOURNAL ON COMPUTING, 1996, 25 (06) : 1144 - 1170
  • [35] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time
    Mozes, Shay
    Wulff-Nilsen, Christian
    ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
  • [36] An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    OPERATIONS RESEARCH, 2017, 65 (04) : 1043 - 1061
  • [37] An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 379 - +
  • [38] Determining the visibility of a planar set of line segments in O(n log log n) time
    Devai, Frank
    Gavrilova, Marina L.
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2007, PT 2, PROCEEDINGS, 2007, 4706 : 51 - 62
  • [39] Towards a practical O(n log n) phylogeny algorithm
    Truszkowski, Jakub
    Hao, Yanqi
    Brown, Daniel G.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2012, 7
  • [40] An O(M(n) log n) Algorithm for the Jacobi Symbol
    Brent, Richard P.
    Zimmermann, Paul
    ALGORITHMIC NUMBER THEORY, 2010, 6197 : 83 - +
12345