Factoring & Reductions for Networks with Imperfect Vertices

IEEE Transactions on Reliability

Volumn 40, Issue 2, 1991, Pages 210-217

  Theologou, Olympia R ^a   Carlier, Jacques G ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Factoring algorithm; Network reduction; Network reliability; Vertex failure

Indexed keywords

COMPUTER AIDED ANALYSIS; MATHEMATICAL TECHNIQUES - GRAPH THEORY; PROBABILITY;

FACTORING ALGORITHM; IMPERFECT VERTICES; NETWORK RELIABILITY; VERTEX FAILURE;

RELIABILITY THEORY;

EID: 0026172999     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.87131     Document Type: Article

References (22)

1. L. Page, J. Perry, “A practical implementation of the factoring theorem for network reliability”, IEEE Trans. Reliability, vol 37, 1988 Aug, pp. 259–267.
2. L. Resende, “Implementation of a factoring algorithm for reliability evaluation of undirected networks”, IEEE Trans. Reliability, vol 37, 1988 Dec, pp. 462–468.
3. O. Theologou, “Contribution to network reliability evaluation” (PhD Thesis), 1990 (in French); Dept. of Computer Science, University of Compiègne, Compiègne, FRANCE.
4. M. Ball, “Complexity of network reliability computations”, Networks, vol 10, 1980, pp. 153–165.
5. K. Aggarwal, J. Gupta, K. Misra, “A simple method for reliability evaluation of a communication network”, IEEE Trans. Communications, 1975 May, pp. 563–566.
6. A. Satyanarayana, R.K. Wood, “A linear-time algorithm for computing K-terminal reliability in series-parallel networks”, SIAM J. Computing, vol 14, 1985 Nov, pp. 818–832.
7. A. Satyanarayana, M. Chang, “Network reliability and the factoring theorem”, Networks, vol 13, 1983, pp. 107–120.
8. R.K. Wood, “Factoring algorithms for computing Af-terminal network reliability”, IEEE Trans. Reliability, vol R-35, 1986 Aug, pp. 269–278.
9. R.K. Wood, “A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability”, Networks, vol 15, 1985, pp. 173–190.
10. L. Fratta, U.G. Montanari, “A Boolean algebra method for computing the terminal reliability in a communication network”, IEEE Trans. Circuit Theory, vol CT-20, 1973 May, pp. 203–211.
11. J.A. Abraham, “An improved algorithm for network reliability”, IEEE Trans. Reliability, vol R-28, 1979 Apr, pp. 58–61.
12. W.H. Debany, P.K. Varshney, C.R.P. Hartmann, “Network reliability evaluation using probability expressions”, IEEE Trans. Reliability, vol R-35, 1986 Jun, pp. 161–166.
13. S. Hariri, C.S. Raghavendra, “SYREL: A symbolic reliability algorithm based on path and cutset methods”, IEEE Trans. Computers, vol C-36, 1987 Oct, pp. 1224–1232.
14. L. Fratta, U.G. Montanari, “A recursive method based on case analysis for computing network terminal reliability”, IEEE Trans. Communications, vol COM-26, 1978 Aug, pp. 1166–1177.
15. W.P. Dotson, J.O. Gobien, “A new analysis technique for probabilistic graphs”, IEEE Trans. Circuits & Systems, vol CAS-26, 1979 Oct, pp. 855–865.
16. 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.
17. W.J. Rueger, “Reliability analysis of networks with capacity constraints and failures at branches and nodes”, IEEE Trans. Reliability, vol R-35, 1986 Dec, pp. 523–528.
18. D.R. Shier, D.E. Whited, “Algebraic methods applied to network reliability problems”, SIAM J. Alg. Disc. Meth., vol 8, 1987 Apr, pp. 251–262.
19. P.M. Lin, B.J. Leon, T.C. Huang, “A new algorithm for symbolic system reliability analysis”, IEEE Trans. Reliability, vol R-25, 1976 Apr, pp. 2–15.
20. 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.
21. J.S. Provan, M. Ball, “Computing network reliability in time polynomial in the number of cuts”, Operations Research, vol 32, 1984, pp. 516–526.
22. M. Page Bailey, V.G. Kulkarni, “A recursive algorithm for computing exact reliability measures”, IEEE Trans. Reliability, vol R-35, 1986 Apr, pp. 36–40.