Computational Complexity of Network Reliability Analysis: An Overview

From MaRDI portal
Publication:3738890

DOI10.1109/TR.1986.4335422zbMath0602.90061MaRDI QIDQ3738890

Michael O. Ball

Publication date: 1986

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)




Related Items (49)

Optimal coteries and voting schemesFast computation of bounds for two-terminal network reliabilityReliability analysis of a simple replicated and-fork/and-join graphPractical sequential bounds for approximating two-terminal reliabilityDouble resource optimization for a robust computer network subject to a transmission budgetThe value of information in stochastic maximum flow problemsAn adaptive zero-variance importance sampling approximation for static network dependability evaluationExact algorithms for bi-objective ring tree problems with reliability measuresA combined decomposition-reduction approach to the K-terminal reliability of. stochastic networksChance-Constrained Optimization of Reliable Fixed Broadband Wireless NetworksA heuristic approach to generating file spanning trees for reliability analysis of distributed computing systemsPolynomial-time algorithms for multimarginal optimal transport problems with structureFast reliability ranking of matchstick minimal networksOn the reliability estimation of stochastic binary systemsUniformly optimally reliable graphs: A surveyEFFECT OF TRAFFIC DEMAND VARIATION ON ROAD NETWORK RESILIENCETwo-commodity reliability evaluation for a stochastic-flow network with node failureThe approximability of multiple facility location on directed networks with random arc failuresUnnamed ItemA practical bounding algorithm for computing two-terminal reliability based on decomposition techniqueA recursive formula for the reliability of a \(r\)-uniform complete hypergraph and its applicationsOptimal coteries for rings and related networksAn algorithm to compute the all-terminal reliability measure.Linguistic performance evaluation for an ERP system with link failuresAn efficient algorithm for link prediction in temporal uncertain social networksGenerating the states of a binary stochastic systemDesign of reliable networksSearch for MC in modified networksReliability evaluation of multi-state systems under cost considerationA new simulation method based on the RVR principle for the rare event network reliability problemAn Approximate Algorithm for the Robust Design in a Stochastic-Flow NetworkInteractive Reliability Analysis on a MicrocomputerTopological optimization of reliable networks under dependent failuresA novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networksAn improved algorithm for finding all upper boundary points in a stochastic-flow networkUnnamed ItemFull complexity analysis of the diameter-constrained reliabilityPower Indices in Spanning Connectivity GamesAn Improvement to the Total Hazard Method for System Reliability SimulationA Polynomial-Time Approximation Algorithm for All-Terminal Network ReliabilityReliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristicA lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphsCapacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacityTerminal-pair reliability in ATM virtual path networksThe expected number of pairs of connected nodes: Pair-connected reliabilityAlgorithms for the determination of cutsets in a hypergraphOptimal double-resource assignment for a distributed multistate networkBalanced and Approximate Zero-Variance Recursive Estimators for the Network Reliability ProblemReliability evaluation in terms of flow data mining for multistate networks




This page was built for publication: Computational Complexity of Network Reliability Analysis: An Overview