MINIMUM S-T CUT OF A PLANAR UNDIRECTED NETWORK IN O(N LOG2 (N)) TIME

被引：59
|
作者：
REIF, JH
机构：
来源：
SIAM JOURNAL ON COMPUTING | 1983年 / 12卷 / 01期
关键词：
D O I：
10.1137/0212005
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：71 / 81
页数：11
相关论文
共 50 条
  • [1] Minimum Cut in O(m log2 n) Time
    Gawrychowski, Pawel
    Mozes, Shay
    Weimann, Oren
    [J]. THEORY OF COMPUTING SYSTEMS, 2024, 68 (04) : 814 - 834
  • [2] AN O(N LOG2 N) ALGORITHM FOR MAXIMUM FLOW IN UNDIRECTED PLANAR NETWORKS
    HASSIN, R
    JOHNSON, DB
    [J]. SIAM JOURNAL ON COMPUTING, 1985, 14 (03) : 612 - 624
  • [3] Minimum Cut of Directed Planar Graphs in O(n log log n) Time
    Mozes, Shay
    Nikolaev, Kirill
    Nussbaum, Yahav
    Weimann, Oren
    [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 477 - 494
  • [4] Shortest Paths in Planar Graphs with Real Lengths in O(n log2 n/log log n) Time
    Mozes, Shay
    Wulff-Nilsen, Christian
    [J]. ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 206 - +
  • [5] Simple O(n log2 n) Algorithms for the Planar 2-Center Problem
    Tan, Xuehou
    Jiang, Bo
    [J]. COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 481 - 491
  • [6] Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time
    Bilke, Andreas
    Cooper, Colin
    Elsaesser, Robert
    Radzik, Tomasz
    [J]. PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, : 451 - 453
  • [7] Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
    Diks, Krzysztof
    Stanczyk, Piotr
    [J]. SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 321 - 333
  • [8] A O(n log2 n) Checker and O(n2 log n) Filtering Algorithm for the Energetic Reasoning
    Ouellet, Yanick
    Quimper, Claude-Guy
    [J]. INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2018, 2018, 10848 : 477 - 494
  • [9] Expected Linear Time Sorting for Word Size Ω(log2 n log log n)
    Belazzougui, Djamal
    Brodal, Gerth Stolting
    Nielsen, Jesper Sindahl
    [J]. ALGORITHM THEORY - SWAT 2014, 2014, 8503 : 26 - +
  • [10] Parallel Minimum Cuts in O(m log2 n) Work and Low Depth
    Anderson, Daniel
    Blelloch, Guy E.
    [J]. ACM TRANSACTIONS ON PARALLEL COMPUTING, 2023, 10 (04)
12345