Network transformations and bounding network reliability

Three transformations on networks that reduce the all-terminal network reliability (probability of connectedness) of a network are shown not to increase any coefficient in one form of the reliability polynomial of the network. These transformations yield efficiently computable lower bounds on each coefficient of the reliability polynomial. A further transformation due to Lomonosov is shown not to decrease any coefficient in the reliability polynomial, leading to an efficiently computable upper bound on each coefficient. The resulting bounds on coefficients can, in turn, be used to obtain a substantial improvement on the Ball—Provan strategy for computing lower and upper bounds on the all-terminal reliability. © 1993 John Wiley & Sons, Inc.

[1]  J. Scott Provan,et al.  Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.

[2]  J. Edmonds.  Minimum partition of a matroid into independent subsets , 1965 .

[3]  W. T. Tutte.  On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[4]  Mihalis Yannakakis,et al.  Edge-Deletion Problems , 1981, SIAM J. Comput..

[5]  J. S. Provan,et al.  Bounds on the reliability polynomial for shellable independence systems , 1982 .

[6]  Béla Bollobás,et al.  Random Graphs , 1985 .

[7]  C. Nash-Williams.  Edge-disjoint spanning trees of finite graphs , 1961 .

[8]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[9]  Appajosyula Satyanarayana,et al.  Least reliable networks and the reliability domination , 1990, IEEE Trans. Commun..

[10]  R. Stanley.  Cohen-Macaulay Complexes , 1977 .

[11]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[12]  A. Kelmans.  On graphs with randomly deleted edges , 1981 .

[13]  Joseph A. Wald,et al.  Steiner trees in probabilistic networks , 1983 .

[14]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[15]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[16]  Appajosyula Satyanarayana,et al.  A reliability-improving graph transformation with applications to network reliability , 1992, Networks.

[17]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[18]  Charles J. Colbourn,et al.  Counting almost minimum cutsets with reliability applications , 1987, Math. Program..