Speeding up computation of the reliability polynomial coefficients for a random graph

DOI10.1134/S0005117911070150MaRDI QIDQ650005zbMATH OpenOpenAlexFDO

Authors Alexei S. Rodionov

Publication date 25 November 2011

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0005117911070150

zbMATH Keywords

random graph with reliable vertices and unreliable edges

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• An approximation algorithm for the coefficients of the reliability polynomial
• scientific article; zbMATH DE number 4083346
• scientific article; zbMATH DE number 3947973
• Fast sequential importance sampling to estimate the graph reliability polynomial
• Combining monte carlo estimates and bounds for network reliability

Cites work

• Computational Science and Its Applications – ICCSA 2004
• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 1295362 (Why is no real title available?)
• scientific article; zbMATH DE number 617592 (Why is no real title available?)
• Network reliability and the factoring theorem

Cited in

(3)

• Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula
• An approximation algorithm for the coefficients of the reliability polynomial
• scientific article; zbMATH DE number 4083346 (Why is no real title available?)

This page was built for publication: Speeding up computation of the reliability polynomial coefficients for a random graph

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