论文信息 - On the Factorization of Network Reliability with Perfect Nodes - 字舞流文

On the Factorization of Network Reliability with Perfect Nodes

A new general all terminal network reliability factorization theorem is stated. We relegate the proof to a forthcoming second part paper.

Franco Robledo | Juan Manuel Burgos | J. M. Burgos | F. Robledo

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

[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] J.P. Gadani,et al. System Effectiveness Evaluation Using Star and Delta Transformations , 1981, IEEE Transactions on Reliability.

[4] Juan Manuel Burgos,et al. Factorization of network reliability with perfect nodes II: Connectivity matrix , 2016, Discret. Appl. Math..

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

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

[7] D. Shier. Network Reliability and Algebraic Structures , 1991 .

[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] Geoffrey Grimmett. The Random-Cluster Model , 2002, math/0205237.

[10] A. Rosenthal. Computing the Reliability of Complex Networks , 1977 .