Computational Complexity of Network Reliability Analysis: An Overview

IEEE Transactions on Reliability

Volumn 35, Issue 3, 1986, Pages 230-239

  Ball, Michael O ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Computational complexity; Graph theory; Network reliability

Indexed keywords

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

References (40)

1. A. Agrawal, A. Satyanarayana, “Network reliability analysis using 2-connected digraph reductions”, Networks, vol 15, 1985, pp 239-256.
2. A. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
3. M. O. Ball, “Computing network reliability”, Operations Res., vol 27, 1979, pp 823–838.
4. M. O. Ball, Network Reliability Analysis: Algorithms and Complexity. PhD Thesis, Cornell University, 1977.
5. M. O. Ball, “The complexity of network reliability computations”, Networks, vol 10, 1980, pp 153–165.
6. M. O. Ball, G. L. Nemhauser, “Matroids and a reliability analysis problem”, Math, of Ops. Res., vol 4, 1979, pp 132–143.
7. M. O. Ball, J. S. Provan, “Bounds on the reliability polynomial for shellable independence systems”, SIAM J. Algebraic Discrete Methods, vol 3, 1982, pp 166–181.
8. M. O. Ball, J. S. Provan, “Calculating bounds on reachability and connectedness in stochastic networks”, Networks, vol 13, 1983, pp 253–278.
9. Z. W. Birnbaum, J. D. Esary, S. C. Saunders, “Multicomponent structures and their reliability”, Technometrics, vol 3, 1961, pp 55–77.
10. R. Bixby, “The minimum number of edges and vertices in a graph with edge connectivity A and M N-bonds“, Networks, vol 5, 1975, pp 259–298.
11. J. A. Buzacott, “A recursive algorithm for finding reliability measures related to connection of nodes in a graph”, Networks, vol 10, 1980, pp 311–328.
12. J. Edmonds, “Edge Disjoint Branchings”, in Combinatorial Algorithms, R. Rustin, ed., Algorithmics, New York, 1972, pp 91–96.
13. J. Edmonds, R. Karp, “Theoretical improvements in algorithmic efficiency for network flow problems”, J. Assoc. Computing Machinery, vol 19, 1972, pp 248–264.
14. S. Even, R. E. Tarjan, “Network flow and testing graph connectivity”, SIAM J. Computing., vol 4, 1975, pp 507–518.
15. L. R. Ford, D. R. Fulkerson, Flows in Networks, Princeton University, 1962.
16. H. Frank, R. E. Kahn, L. Kleinrock, “Computer communication network design: experience with theory and practice”, AFIPS Natl. Comput. Conf. Expo. Proc., vol 40, 1972, pp 255–270.
17. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
18. M. R. Garey, D. S. Johnson, “The rectilinear Steiner tree problem is NP-complete” SIAM J. Applied Math., vol 32, 1979, pp 826–834.
19. M. Grotschel, M. Padberg, “Polyhedral aspects of the traveling salesman problem II: Computation”, Preprint #5, Mathematisches Institut, Universitat Augsburg, 1983.
20. R. M. Karp, “Reducibility among combinatorial problems”, in R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations Plenum Press, 1972, pp 85–103.
21. A. Kershenbaum, R. M. Van Slyke, “Recursive analysis of network reliability”, Networks, vol 3, 1973, pp 81–94.
22. G. Kirhhoff, “Uber die auflosung der gleichungen auf welche man sei der untersuchung der linearen verteilung galvanischer strome gefuhrt wird.”, Poggendorg's Ann: Phys. Chem;, vol 72, 1847, pp 497–508. English translation, IRE Trans. Circuit Theory., CT-5, 1958, pp 4–81.
23. C. Y. Lee, “Analysis of switching networks”, Bell System Technical J., vol 34, 1955, pp 1287–1315.
24. M. Moghtaderizadeh, R. K. Wood, A. Der Kiureghian, R. E. Barlow, T. Sato, “Seismic reliability of flow and communication networks”, manuscript, 1981.
25. E. F. Moore, “The shortest path through a maze”, Ann. Computation Lab. Harvard Univ. vol 30, 1959, pp 285–292.
26. E. F. Moore, C. E. Shannon, “Reliable circuits using less reliable relays’’, J. Franklin Inst., vol 262, 1956, pp 191–208, 281–297.
27. T. Politof, A. Satyanarayana, “An O(V ) algorithm for a class of planar graphs to compute the probability that a graph is connected’’, Tech. Rep. ORC 84–4, Operations Research Center, University of California, Berkeley, California, 1984 Apr.
28. J. S. Provan, “The complexity of reliability computations in planar and acyclic networks’’, Tech. Rep # UNC/ORSA/JR-83/12, University of North Carolina, Chapel Hill, North Carolina, 1983 Nov.
29. J. S. Provan, M. O. Ball, “The complexity of counting cuts and computing the probability that a graph is connected’’, SIAM J. Computing, vol 12, 1983, pp 777–788.
30. J. S. Provan, M. O. Ball, “Computing network reliability in time polynomial in the number of cuts’’, Operations Research, vol 32, 1984, pp 516–526.
31. A. Rosenthal, “A computer scientist looks at reliability computations’’, In [40], pp 133–152.
32. A. Rosenthal, “Computing the reliability of complex networks”, SIAM J. Appl. Math, vol 32, 1977, pp 384–393.
33. A. Rosenthal, “Series and parallel reductions for complex measures of network reliability’’, Networks, vol 11, 1981, pp 323–334.
34. A. Satyanarayana, A. Prabhakar, “New topological formula and rapid algorithm for reliability analysis of complex networks”, IEEE Trans. Reliability, vol R-27, 1978 Jun, pp 82–100.
35. A. Satyanarayana, K. Wood, “Polygon-to-chain reductions and network reliability”, Technical Report #ORC 82–4, Operations Research Center, University of California, Berkeley, California, 1982, to be published in SIAM J. Computing.
36. L. G. Valiant, “The complexity of enumeration and reliability problems”, SIAM J. Comput., vol 8, 1979, pp 410–421.
37. R. M. Van Slyke, H. Frank, “Network reliability analysis 1”, Networks, vol 1, 1972, pp 279–290.
38. R. M. Van Slyke, H. Frank, A. Kershenbaum, “Network reliability analysis: Part II”, in [40], pp 619–650.
39. F. Wu, “Reliability evaluation of electric power networks”, presented at Network Reliability Workshop, Stevens Institute of Technology, 1983 Aug.
40. Reliability and Fault Tree Analysis, R. E. Barlow, J. B. Fussell and N. P. Singpurwalla, eds., SIAM, Philadelphia, 1975.