Factorization of Constrained Energy K-Network Reliability with Perfect Nodes

Preprint English OPEN
Burgos, Juan Manuel;
  • Subject: Mathematics - Combinatorics

This paper proves a new general K-network constrained energy reliability global factorization theorem. As in the unconstrained case, beside its theoretical mathematical importance the theorem shows how to do parallel processing in exact network constrained energy reliab... View more
  • References (10)

    [Bi] N.L.Biggs, Algebraic Graph Theory, Cambridge, Cambridge University Pres, 1993.

    [Bu] J.M.Burgos, K-Con abilidad en Redes: Factorizacion y Comportamiento Asintotico, Msc.Thesis, Universidad de la Republica, Montevideo, Uruguay, 2012.

    [BR] J.M.Burgos, F.Robledo, On the Factorization of Network Reliability with Perfect Nodes, Submitted to Networks, 2012, arXiv:1305.0972

    [Co] C.J.Colbourn, The Combinatorics of Network Reliability, New York, Oxford University Press, 1987.

    [Ga] J.P.Gadani, System e ectiveness evaluation using star and delta transformations, IEEE Trans.Reliability, R-30, No1, 41-47, 1981.

    [Mo] F.Moskovitz and R.A.D.Center, The analysis of redundancy networks, Rome Air Development Center, Air Research and Development Center, United States Air Force, 1958.

    [Ro] A.Rosenthal, Computing the Reliability of Complex Networks, Siam J.Applied Math., 32, No2, 384-393.

    [Rot] J.J.Rotman, Advanced Modern Algebra, Prentice Hall, 2nd printing, 2003.

    [SC] A.Satyanarayana, M.Chang, Network Reliability and the Factoring Theorem, Networks, 13 (1983), 107-120.

    [Wo] R.K.Wood, A factoring algorithm using polygon-to-chain reductions for computing k-terminal network reliability, Networks, 15 (1985), 173-190.

  • Related Organizations (4)
  • Metrics
Share - Bookmark