A practical bounding algorithm for computing two-terminal reliability based on decomposition technique

DOI10.1016/j.camwa.2010.09.033zbMath1219.68073OpenAlexW1993210728MaRDI QIDQ636690

Yi-Feng Niu, Fang-Ming Shao

Publication date: 28 August 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.09.033

zbMATH Keywords

decomposition techniqueMP/MCtwo-terminal reliability

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Fast computation of bounds for two-terminal network reliability, Network connectivity entropy and its application on network connectivity reliability, A quick inclusion-exclusion technique, A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network, Efficient enumeration of \(d\)-minimal paths in reliability evaluation of multistate networks

Cites Work

• Unnamed Item
• Lower bounds on two-terminal network reliability
• Practical sequential bounds for approximating two-terminal reliability
• Computational Complexity of Network Reliability Analysis: An Overview
• The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
• A Reliability Bound for Systems of Maintained, Interdependent Components