Sequential importance sampling algorithms for estimating the all-terminal reliability polynomial of sparse graphs

DOI10.4230/LIPICS.APPROX-RANDOM.2015.323MaRDI QIDQ5351909zbMATH OpenFDO

Authors

Publication date 31 August 2017

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2015.323

zbMATH Keywords

all-terminal reliabilitysequential importance sampling

Mathematics Subject Classification ID

Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fast sequential importance sampling to estimate the graph reliability polynomial
• scientific article; zbMATH DE number 4083346
• An approximation algorithm for the coefficients of the reliability polynomial
• A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
• A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability

Cited in

(2)

• scientific article; zbMATH DE number 4083346 (Why is no real title available?)
• Fast sequential importance sampling to estimate the graph reliability polynomial

This page was built for publication: Sequential importance sampling algorithms for estimating the all-terminal reliability polynomial of sparse graphs

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