The reliability polynomial gives the probability that a graph remains connected given that each edge in it can fail independently with a probability p. While in general determining the coefficients of this polynomial is #P-complete, we give a randomized algorithm for approximating its coefficients. When compared to the known approximation method of Colbourn, Debroni and Myrvold, our method empirically shows a much faster rate of convergence.
Citation: Congressus Numerantium
Pub Type: Journals
reliability polynomial, randomized algorithm