COMPUTING NETWORK RELIABILITY IN TIME POLYNOMIAL IN THE NUMBER OF CUTS

被引：77
|
作者：
PROVAN, JS
BALL, MO
机构：
[1] NBS, WASHINGTON, DC 20234 USA
[2] UNIV N CAROLINA, CHAPEL HILL, NC 27514 USA
[3] UNIV MARYLAND, COLLEGE PK, MD 20742 USA
来源：
OPERATIONS RESEARCH | 1984年 / 32卷 / 03期
关键词：
D O I：
10.1287/opre.32.3.516
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The authors present a new algorithm that computes the probability that there is an operating path from a node s to a node t in a stochastic network. The computation time of this algorithm is bounded by a polynomial in the number of (s,t)-cuts in the network. An examination is also made of the complexity of other connectedness reliability problems with respect to the number of cutsets and pathsets in the network. These problems are distinguished as either having algorithms that are polynomial in the number of such sets, or having no such algorithms unless P equals NP.
引用
下载
收藏
页码：516 / 526
页数：11
相关论文
共 50 条
  • [1] A METHOD OF COMPUTING THE COEFFICIENTS OF THE NETWORK RELIABILITY POLYNOMIAL
    AYANOGLU, E
    I, CL
    DALLAS GLOBECOM 89, VOLS 1-3: COMMUNICATIONS TECHNOLOGY FOR THE 1990S AND BEYOND, 1989, : 331 - 337
  • [2] Computing the clique number of a-perfect graphs in polynomial time
    Pecher, Arnaud
    Wagler, Annegret K.
    EUROPEAN JOURNAL OF COMBINATORICS, 2014, 35 : 449 - 458
  • [3] Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time
    Li, Fengwei
    Zhang, Xiaoyan
    Ye, Qingfang
    Sun, Yuefang
    COMPLEXITY, 2019, 2019
  • [4] Computing clique and chromatic number of circular-perfect graphs in polynomial time
    Arnaud Pêcher
    Annegret K. Wagler
    Mathematical Programming, 2013, 141 : 121 - 133
  • [5] Computing clique and chromatic number of circular-perfect graphs in polynomial time
    Pecher, Arnaud
    Wagler, Annegret K.
    MATHEMATICAL PROGRAMMING, 2013, 141 (1-2) : 121 - 133
  • [6] RELIABILITY POLYNOMIAL FOR A RING NETWORK
    DOTSON, W
    NORWOOD, F
    TAYLOR, C
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (06) : 825 - 827
  • [7] COMPUTING NETWORK RELIABILITY
    BALL, MO
    OPERATIONS RESEARCH, 1979, 27 (04) : 823 - 838
  • [8] A LINEAR-TIME APPROXIMATION METHOD FOR COMPUTING THE RELIABILITY OF A NETWORK
    BELOVICH, SG
    KONANGI, VK
    COMPUTER NETWORKS AND ISDN SYSTEMS, 1991, 21 (02): : 121 - 127
  • [9] Two polynomial-time algorithms for computing reliability in a linear and a circular distributed system
    Lin, MS
    Chen, DJ
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 748 - 752
  • [10] Computing all small cuts in an undirected network
    Nagamochi, H
    Nishimura, K
    Ibaraki, T
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1997, 10 (03) : 469 - 481
12345