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 条
  • [1] Sparsest cuts and concurrent flows in product graphs
    Bonsma, P
    DISCRETE APPLIED MATHEMATICS, 2004, 136 (2-3) : 173 - 182
  • [2] Polynomiality of sparsest cuts with fixed number of sources
    Hong, Sung-Pil
    Choi, Byung-Cheon
    OPERATIONS RESEARCH LETTERS, 2007, 35 (06) : 739 - 742
  • [3] The Complexity Status of Problems Related to Sparsest Cuts
    Bonsma, Paul
    Broersma, Hajo
    Patel, Viresh
    Pyatkin, Artem
    COMBINATORIAL ALGORITHMS, 2011, 6460 : 125 - +
  • [4] Approximating Sparsest Cut in Graphs of Bounded Treewidth
    Chlamtac, Eden
    Krauthgamer, Robert
    Raghavendra, Prasad
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 124 - +
  • [5] The complexity of finding uniform sparsest cuts in various graph classes
    Bonsma, Paul
    Broersma, Hajo
    Patel, Viresh
    Pyatkin, Artem
    JOURNAL OF DISCRETE ALGORITHMS, 2012, 14 : 136 - 149
  • [6] PLASMA ARC CUTS BOTTLENECKS.
    Hoeffer, El
    American Machinist, 1973, 117 (21) : 57 - 58
  • [7] Approximating the SPARSEST k-SUBGRAPH in Chordal Graphs
    Watrigant, Remi
    Bougeret, Marin
    Giroudeau, Rodolphe
    THEORY OF COMPUTING SYSTEMS, 2016, 58 (01) : 111 - 132
  • [8] The use of sparsest cuts to reveal the hierarchical community structure of social networks
    Mann, Charles F.
    Matula, David W.
    Olinick, Eli V.
    SOCIAL NETWORKS, 2008, 30 (03) : 223 - 234
  • [9] Approximating the Sparsest k-Subgraph in Chordal Graphs
    Watrigant, Remi
    Bougeret, Marin
    Giroudeau, Rodolphe
    APPROXIMATION AND ONLINE ALGORITHMS, WAOA 2013, 2014, 8447 : 73 - 84
  • [10] Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results
    Gupta, Anupam
    Talwar, Kunal
    Witmer, David
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 281 - 290
12345