Computing the Reliability of Complex Networks

DOI10.1137/0132031MaRDI QIDQ4158780zbMATH OpenOpenAlexFDO

Authors Arnie Rosenthal

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35)

Cited in

(26)

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

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)