Computational Complexity of Network Reliability Analysis: An Overview
From MaRDI portal
Publication:3738890
DOI10.1109/TR.1986.4335422zbMath0602.90061MaRDI QIDQ3738890
Publication date: 1986
Published in: IEEE Transactions on Reliability (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
90B25: Reliability, availability, maintenance, inspection in operations research
90B20: Traffic problems in operations research
Related Items
Balanced and Approximate Zero-Variance Recursive Estimators for the Network Reliability Problem, An Improvement to the Total Hazard Method for System Reliability Simulation, Search for MC in modified networks, Fast computation of bounds for two-terminal network reliability, Double resource optimization for a robust computer network subject to a transmission budget, The value of information in stochastic maximum flow problems, An adaptive zero-variance importance sampling approximation for static network dependability evaluation, Linguistic performance evaluation for an ERP system with link failures, A practical bounding algorithm for computing two-terminal reliability based on decomposition technique, Reliability evaluation of multi-state systems under cost consideration, Algorithms for the determination of cutsets in a hypergraph, A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems, Generating the states of a binary stochastic system, Design of reliable networks, The expected number of pairs of connected nodes: Pair-connected reliability, Optimal coteries and voting schemes, Reliability analysis of a simple replicated and-fork/and-join graph, Terminal-pair reliability in ATM virtual path networks, A new simulation method based on the RVR principle for the rare event network reliability problem, A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs, Two-commodity reliability evaluation for a stochastic-flow network with node failure, Optimal double-resource assignment for a distributed multistate network, Practical sequential bounds for approximating two-terminal reliability, An algorithm to compute the all-terminal reliability measure., An Approximate Algorithm for the Robust Design in a Stochastic-Flow Network, Full complexity analysis of the diameter-constrained reliability, Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks, A combined decomposition-reduction approach to the K-terminal reliability of. stochastic networks, Interactive Reliability Analysis on a Microcomputer, Power Indices in Spanning Connectivity Games
