Computing the Reliability of Complex Networks
From MaRDI portal
Publication:4158780
DOI10.1137/0132031zbMath0379.90048OpenAlexW2089213868MaRDI QIDQ4158780
Publication date: 1977
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0132031
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) General topics in the theory of software (68N01)
Related Items
The computational complexity of probabilistic inference using Bayesian belief networks, Graph decompositions and tree automata in reasoning with uncertainty, Linear time algorithms for NP-hard problems restricted to partial k- trees, Lower bounds on two-terminal network reliability, Bounds for coherent reliability structures, A decomposition algorithm for network reliability evaluation, Finding the probability of infection in an SIR network is NP-hard, Algebraic Methods Applied to Network Reliability Problems, Decomposability helps for deciding logics of knowledge and belief, Wireless multicasting under probabilistic node failures: a heuristic approach, Exact reliability optimization for series‐parallel graphs using convex envelopes, On the reliability estimation of stochastic binary systems, Counting almost minimum cutsets with reliability applications, Uniformly optimally reliable graphs: A survey, Factorization of network reliability with perfect nodes. I: Introduction and statements, The role of Steiner hulls in the solution to Steiner tree problems, Minimum power multicasting in wireless networks under probabilistic node failures, Recursive conditioning, Unnamed Item, Full complexity analysis of the diameter-constrained reliability, Analyse und Synthese zuverlässiger Netze, Bounds on the Reliability Polynomial for Shellable Independence Systems, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability
