Computing the Reliability of Complex Networks
From MaRDI portal
Publication:4158780
Cited in
(26)- Recursive conditioning
- Wireless multicasting under probabilistic node failures: a heuristic approach
- Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability
- Minimum power multicasting in wireless networks under probabilistic node failures
- A decomposition algorithm for network reliability evaluation
- Decomposability helps for deciding logics of knowledge and belief
- The computational complexity of probabilistic inference using Bayesian belief networks
- Graph decompositions and tree automata in reasoning with uncertainty
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Counting almost minimum cutsets with reliability applications
- A Hostile model for network reliability analysis
- On the reliability estimation of stochastic binary systems
- Bounds for coherent reliability structures
- Full complexity analysis of the diameter-constrained reliability
- Exact reliability optimization for series‐parallel graphs using convex envelopes
- Finding the probability of infection in an SIR network is NP-hard
- Factorization of network reliability with perfect nodes. I: Introduction and statements
- The role of Steiner hulls in the solution to Steiner tree problems
- Uniformly optimally reliable graphs: A survey
- Lower bounds on two-terminal network reliability
- Cyclic edge and cyclic vertex connectivity of \((4, 5, 6)\)-fullerene graphs
- Factorization and exact evaluation of the source-terminal diameter-constrained reliability
- Algebraic Methods Applied to Network Reliability Problems
- Analyse und Synthese zuverlässiger Netze
- Bounds on the Reliability Polynomial for Shellable Independence Systems
This page was built for publication: Computing the Reliability of Complex Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158780)