Network reliability and the factoring theorem

DOI10.1002/net.3230130107zbMath0504.90031OpenAlexW2008013300MaRDI QIDQ4740315

No author found.

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 complexitydominationfactoring theoremnetwork reliability analysisconnectedness test for subgraphsoptimal binary structure

Mathematics Subject Classification ID

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

Related Items (28)

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

Cites Work

• Unnamed Item
• The Use of S-Functions in Combinatorial Analysis

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