Factoring Algorithms for Computing K-Terminal Network Reliability

Let GK denote a graph G whose edges can fail and with a set K ¿ V specified. Edge failures are independent and have known probabilities. The K-terminal reliability of GK, R(GK), is the probability that all vertices in K are connected by working edges. A factoring algorithm for computing network reliability recursively applies the formula R(GK) = piR(GK * ei) + qiR(GK - ei) where GK * ei is GK, with edge ei contracted, GK - ei is GK with ei deleted and pi ¿ 1 - qi is the reliability of edge ei. Various reliability-preserving reductions can be performed after each factoring operation in order to reduce computation. A unified framework is provided for complexity analysis and for determining optimal factoring strategies. Recent results are reviewed and extended within this framework.

[1]  Mark K. Chang,et al.  Network reliability and the factoring theorem , 1983, Networks.

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

[3]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[4]  U. Montanari,et al.  A Boolean algebra method for computing the terminal reliability in a communication network , 1973 .

[5]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[6]  W. T. Tutte.  Connectivity in graphs , 1966 .

[7]  A. Prabhakar,et al.  New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks , 1978, IEEE Transactions on Reliability.

[8]  Fred Moskowitz,et al.  The analysis of redundancy networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[9]  Hayao Nakazawa.  Bayesian Decomposition Method for Computing the Reliability of an Oriented Network , 1976, IEEE Transactions on Reliability.

[10]  J. Abraham.  An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.

[11]  K. B. Misra,et al.  An Algorithm for the Reliability Evaluation of Redundant Networks , 1970 .

[12]  Michael O. Ball.  Computing Network Reliability , 1979, Oper. Res..

[13]  A. Satyanarayana,et al.  A Unified Formula for Analysis of Some Network Reliability Problems , 1982, IEEE Transactions on Reliability.

[14]  A. Satyanarayana,et al.  New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks , 1978 .

[15]  John A. Buzacott,et al.  A recursive algorithm for finding reliability measures related to the connection of nodes in a graph , 1980, Networks.

[16]  Michael Owen Ball.  Network reliability analysis: algorithms and complexity. , 1977 .

[17]  George L. Nemhauser,et al.  Matroids and a Reliability Analysis Problem , 1979, Math. Oper. Res..

[18]  R. Kevin Wood.  A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability , 1985, Networks.

[19]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[20]  Claude E. Shannon,et al.  Reliable Circuits Using Less Reliable Relays , 1956 .

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .