scientific article; zbMATH DE number 4083346

From MaRDI portal
Publication:3813587





[For the entire collection see Zbl 0656.00028.] Using an efficient algorithm for generating random spanning trees of a graph, we develop a Monte Carlo sampling technique for estimating the coefficients of the (all-terminal) reliability polynomial of the graph. The resulting method reduces the variance of naive Monte Carlo methods, and hence requires many fewer trials.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813587)