Network reliability and the factoring theorem

DOI10.1002/NET.3230130107MaRDI QIDQ4740315zbMATH OpenOpenAlexFDO

Authors

Publication date 1983

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230130107

zbMATH Keywords

algorithmcomputational complexityconnectedness test for subgraphsdominationfactoring theoremnetwork reliability analysisoptimal binary structure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites work

• scientific article; zbMATH DE number 3591262 (Why is no real title available?)
• The Use of S-Functions in Combinatorial Analysis

Cited in

(30)

• An analysis of Monte Carlo algorithms for counting problems
• Chromatic polynomials and network reliability
• Generalized activities and \(K\)-terminal reliability
• Design of reliable networks
• Domination of cyclic monotone \((s,t)\)-graphs
• Sixty years of network reliability
• A new simulation method based on the RVR principle for the rare event network reliability problem
• Expected value expansions in rooted graphs
• A decomposition algorithm for network reliability evaluation
• On locally most reliable three-terminal graphs of sparse graphs
• Bayesian inference based on partial monitoring of components with applications to preventive system maintenance
• Fast computation of bounds for two-terminal network reliability
• A survey of some network reliability analysis and synthesis results
• Interactive Reliability Analysis on a Microcomputer
• Computational Complexity of Coherent Systems and the Reliability Polynomial
• Some Alternate Characterizations of Reliability Domination
• On an Invariant of Graphs and the Reliability Polynomial
• Algebraic Methods Applied to Network Reliability Problems
• Balanced and approximate zero-variance recursive estimators for the network reliability problem
• Exact reliability optimization for series‐parallel graphs using convex envelopes
• Uniformly optimally reliable graphs: A survey
• Network reliability: Heading out on the highway
• Oriented matroid systems
• Factorization and exact evaluation of the source-terminal diameter-constrained reliability
• Speeding up computation of the reliability polynomial coefficients for a random graph
• Note on complexity of computing the domination of binary systems
• Reliable assignments of processors to tasks and factoring on matroids
• An optimization-based Monte Carlo method for estimating the two-terminal survival signature of networks with two component classes
• Factorization of network reliability with perfect nodes. I: Introduction and statements
• Factorization of network reliability with perfect nodes. II: Connectivity matrix

This page was built for publication: Network reliability and the factoring theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740315)