Calculating K-Connectedness Reliability Using Steiner Bounds

DOI10.1287/MOOR.21.4.905MaRDI QIDQ4332257zbMATH OpenOpenAlexFDO

Authors Manoj K. Chari, J. Scott Provan

Publication date 13 February 1997

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.21.4.905

zbMATH Keywords

\(K\)-connectedness reliability problemboundsterminal vertices

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• A note on bounding \(k\)-terminal reliability
• scientific article; zbMATH DE number 1218894
• Counting Problems Associated With Steiner Trees In Graphs
• Improving reliability bounds in computer networks
• Lower bounds on two-terminal network reliability

Cited in

(4)

• A note on bounding \(k\)-terminal reliability
• Reliability covering problems for hypergraphs
• Counting Problems Associated With Steiner Trees In Graphs
• Information security: Designing a stochastic-network for throughput and reliability

This page was built for publication: Calculating K-Connectedness Reliability Using Steiner Bounds

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