Factoring Algorithms for Computing K-Terminal Network Reliability

IEEE Transactions on Reliability

Volumn 35, Issue 3, 1986, Pages 269-278

  Wood, R Kevin ^a  

^a NAVAL POSTGRADUATE SCHOOL   (United States)

Author keywords

Factoring; Network reliability; Pivotal decomposition; Reliability preserving reductions

Indexed keywords

EID: 82455174512     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/TR.1986.4335431     Document Type: Article

References (30)

1. Fred Moskowitz, “The analysis of redundancy networks”, AIEE Trans. (Commun. Electron.), vol 39, 1958, pp 627–632.
2. K. B. Misra, “An algorithm for the reliability evaluation of redundant networks”, IEEE Trans. Reliability, vol R-19, 1970, pp 146–151.
3. J. Murchland, “Calculating the probability that a graph is disconnected”, Working Paper No. 182, 1973.
4. Arnon Rosenthal, “Computing reliability of complex systems”, PhD Thesis, University of California, Berkeley, 1974.
5. Arnon Rosenthal, “A computer scientist looks at reliability calculations”, Reliability and Fault Tree Analysis, eds. R. E. Barlow, J. B. Fussel, N. D. Singpurwalla, SIAM, 1977, pp 133–152.
6. H. Nakazawa, “Bayesian decomposition method for computing reliability of an oriented network”, IEEE Trans. Reliability, vol R-25, 1976, pp 77–80.
7. Michael O. Ball, “Network reliability analysis: Algorithms and complexity”, PhD Thesis, Cornell University, 1977.
8. Michael O. Ball, “Computing network reliability”, Operations Research, vol 27, pp 132–143.
9. M. O. Ball, G. L. Nemhauser, “Matroids and a reliability analysis problem”, Math, of OR, vol 4, No. 2, 1979, pp 132–143.
10. Mark K. Chang, “A graph theoretic appraisal of the complexity of network reliability algorithms”, PhD Thesis, Dept, of IEOR, University of California Berkeley, 1981.
11. Rubin Johnson, “Some Combinatorial Aspects of Network Reliability”, PhD. Thesis, Dept, of IEOR, University of California, Berkeley, 1982.
12. A. Satyanarayana, M. K. Chang, “Network reliability and the factoring theorem”, Networks, vol 13, 1983, pp 107–120.
13. R. Kevin Wood, “A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability”, Networks, vol 15, 1985, pp 173–190.
14. Michael O. Ball, “An overview of the complexity of network reliability computations”, IEEE Trans. Reliability, vol R-36, 1986 Aug, pp ?-?. Also a technical report, College of Business and Management, University of Maryland, College Park, 1984.
15. E. F. Moore, C. E. Shannon, “Reliable circuits using less reliable relays”, J. Franklin Institute, vol 262, 1956, pp 191–208, and 281–297.
16. R. E. Barlow, F. Proschan, Statistical Theory of Reliability, Holt, Rinehart and Winston, 1975.
17. L. Fratta, and U. Montanari, “A boolean algebra method for computing the terminal reliability in a communication network”, IEEE Trans. Circuit Theory, CT-20, 1973, pp 203–211.
18. J. A. Abraham, “An improved algorithm for network reliability”, IEEE Trans. Reliability, vol R-28, 1979, pp 58–61.
19. J. A. Buzacott, “A recursive algorithm for finding reliability measures related to the connection of nodes in a graph”, Networks, vol 10, 1980, pp 311–327.
20. A. Satyanarayana, A. Prabhakar, “New topological formula and rapid algorithm for reliability analysis of complex systems”, IEEE Trans. Reliability, vol R-27, 1980, pp 82–100.
21. A. Satyanarayana, “A unified formula for analysis of some network reliability problems”, IEEE Trans. Reliability, vol R-31, 1982, pp 23–32.
22. Avinash Agrawal, “Reliability analysis of rooted directed networks”, PhD Thesis, Dept, of IEOR, University of California, Berkeley, 1982.
23. A. Satyanarayana, “Minimal domination of graphs”, Reliability Seminar Talk, Operations Research Center, University of California Berkeley, 1980 August.
24. W. T. Tutte, Connectivity in Graphs, University of Toronto Press, Toronto, 1966.
25. J. E. Hopcroft, and R. E. Tarjan, “Dividing a graph into triconnected components”, SIAM J. Computing, vol 2, 1973, pp 135–158.
26. A. Satyanarayana, R. K. Wood, “A linear-time algorithm for computing K-terminal reliability in series-parallel graphs”, SIAM J. Computing, to appear.
27. R. Kevin Wood, “Polygon-to-Chain reductions and extensions for computing K-terminal reliability in an undirected network”, ORC 82–12, Operations Research Center, University of California, Berkeley, 1982.
28. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., 1979.
29. R. Endre Tarjan, “Depth-first search and linear graph algorithms”, SIAM J. Computing, 1, 1972, pp 146–160.
30. A. Satyanarayana, R. Procesi-Ciampi, “On some acyclic orientations of a graph”, ORC81-11, Operations Research Center, University of California, Berkeley, 1981.