Exact methods to compute network reliability
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4045097
- A decomposition algorithm for network reliability evaluation
- Factoring Algorithms for Computing K-Terminal Network Reliability
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- Reliability Computations for Planar Networks
Cited in
(15)- Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
- A network reduction axiom for efficient computation of terminal-pair reliability
- Computing and maximizing the exact reliability of wireless backhaul networks
- The cross-entropy method for network reliability estimation
- Computing 2-terminal reliability for radio-broadcast networks
- A new BDD-based reliability evaluation method for networks with imperfect vertices
- Reliability evaluation according to a routing scheme for multi-state computer networks under assured accuracy rate
- Estimation of network reliability using optimal ROBDD approach.
- scientific article; zbMATH DE number 4145632 (Why is no real title available?)
- On Reliability Evaluation by Network Decomposition
- Efficient algorithms for reliability analysis of planar networks - a survey
- scientific article; zbMATH DE number 4045097 (Why is no real title available?)
- Exact reliabilities of most reliable double-loop networks
- A framework for network reliability problems on graphs of bounded treewidth
- Markov chain method for computing the reliability of hammock networks
This page was built for publication: Exact methods to compute network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251684)
