A modified algorithm for computing the upper-bound reliabilty of computer networks
From MaRDI portal
Publication:706780
DOI10.1016/J.AMC.2003.11.019zbMATH Open1095.68005OpenAlexW2016688501MaRDI QIDQ706780FDOQ706780
Authors: D. Kharzeev 
Publication date: 9 February 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.11.019
Recommendations
- An Algorithm for Network Reliability Bounds
- Improving reliability bounds in computer networks
- scientific article; zbMATH DE number 1218894
- An improved algorithm for reliability bounds of multistate networks
- An efficient algorithm for computing global reliability of a network
- scientific article; zbMATH DE number 176263
- scientific article; zbMATH DE number 4027153
- Bounding the Reliability of Networks
- A simple algorithm for computing network reliability
- A novel algorithm on network reliability estimation
Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- On Reliability Evaluation by Network Decomposition
- Reliability Evaluation by Network Decomposition
- Bayesian Decomposition Method for Computing the Reliability of an Oriented Network
- A Method for Calculation of Network Reliability
- The Identification of Combinational Logic Switching Structure
Cited In (3)
This page was built for publication: A modified algorithm for computing the upper-bound reliabilty of computer networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706780)
