Springer-Verlag, Vol. 5593, pp. 557-571, Jun. 2009
Alexey Rodionov, Olga Rodionova, and Hyunseung Choo
We propose some new approaches to the problem of obtaining the reliability polynomial of a random graph. The meaning of coefficients of the reliability polynomial in one of its presentation is used for the significant reducing of calculations while the factoring method underlies. Experiments shows significant speeding up in compare with well known package Maple 11 (up to 2000 times on the standard lattice example).