scientific article; zbMATH DE number 4083346

MaRDI QIDQ3813587zbMATH OpenFDO

Authors Charles J. Colbourn, Bradley M. Debroni, Wendy Myrvold

Publication date 1988

zbMATH Keywords

computer networksMonte Carlo sampling techniquenetwork reliabilityrandom spanning treesreliability assessmentreliability polynomial

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• An approximation algorithm for the coefficients of the reliability polynomial
• Fast sequential importance sampling to estimate the graph reliability polynomial
• Sequential importance sampling algorithms for estimating the all-terminal reliability polynomial of sparse graphs
• Speeding up computation of the reliability polynomial coefficients for a random graph
• Combining monte carlo estimates and bounds for network reliability

Cited in

(7)

• scientific article; zbMATH DE number 5944468 (Why is no real title available?)
• Computing network reliability coefficients
• An approximation algorithm for the coefficients of the reliability polynomial
• scientific article; zbMATH DE number 3947973 (Why is no real title available?)
• Fast sequential importance sampling to estimate the graph reliability polynomial
• Sequential importance sampling algorithms for estimating the all-terminal reliability polynomial of sparse graphs
• Speeding up computation of the reliability polynomial coefficients for a random graph

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)