SPARSEST CUTS AND BOTTLENECKS IN GRAPHS

被引：55
|
作者：
MATULA, DW [1 ]
SHAHROKHI, F [1 ]
机构：
[1] UNIV N TEXAS,DEPT COMP SCI,DENTON,TX 76203
来源：
DISCRETE APPLIED MATHEMATICS | 1990年 / 27卷 / 1-2期
关键词：
D O I：
10.1016/0166-218X(90)90133-W
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The problem of determining a sparsest cut in a graph is characterized and its computation shown to be NP-hard. A class of sparsest cuts, termed bottlenecks, is characterized by a dual relation to a particular polynomial time computable multicommodity flow problem. Efficient computational techniques for determining bottlenecks in a broad class of instances are presented. © 1990.
引用
收藏
页码：113 / 123
页数：11
相关论文
共 50 条
  • [21] ON CUTS AND MATCHINGS IN PLANAR GRAPHS
    BARAHONA, F
    MATHEMATICAL PROGRAMMING, 1993, 60 (01) : 53 - 68
  • [22] Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter
    Chalermsook, Parinya
    Kaul, Matthias
    Mnich, Matthias
    Spoerhase, Joachim
    Uniyal, Sumedha
    Vaz, Daniel
    ACM TRANSACTIONS ON ALGORITHMS, 2024, 20 (01)
  • [23] Packing multiway cuts in capacitated graphs
    Barman, Siddharth
    Chawla, Shuchi
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 1048 - 1057
  • [24] Special minimum cuts in directed graphs
    Fueloep, Ottilia
    ARS COMBINATORIA, 2015, 122 : 125 - 148
  • [25] Random walks and local cuts in graphs
    Chung, Fan
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 423 (01) : 22 - 32
  • [26] Extremal graphs having no matching cuts
    Bonsma, Paul
    Farley, Arthur M.
    Proskurowski, Andrzej
    JOURNAL OF GRAPH THEORY, 2012, 69 (02) : 206 - 222
  • [27] Graphs with largest number of minimum cuts
    Lehel, J
    Maffray, F
    Preissmann, M
    DISCRETE APPLIED MATHEMATICS, 1996, 65 (1-3) : 387 - 407
  • [28] Clustering by weighted cuts in directed graphs
    Meila, Marina
    Pentney, William
    PROCEEDINGS OF THE SEVENTH SIAM INTERNATIONAL CONFERENCE ON DATA MINING, 2007, : 135 - +
  • [29] Cuts in Undirected Graphs. II
    F. Sharifov
    L. Hulianytskyi
    Cybernetics and Systems Analysis, 2020, 56 : 745 - 752
  • [30] Graphs with Many Independent Vertex Cuts
    Hu, Yanan
    Zhan, Xingzhi
    Zhang, Leilei
    GRAPHS AND COMBINATORICS, 2024, 40 (04)
12345