Computational Complexity of Network Reliability Analysis: An Overview
From MaRDI portal
Recommendations
Cited in
(64)- A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems
- Combinatorial aspects of network reliability
- 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
- Exact algorithms for bi-objective ring tree problems with reliability measures
- A recursive formula for the reliability of a r-uniform complete hypergraph and its applications
- An efficient algorithm for link prediction in temporal uncertain social networks
- A new simulation method based on the RVR principle for the rare event network reliability problem
- Topological optimization of reliable networks under dependent failures
- 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
- Reliability evaluation in terms of flow data mining for multistate networks
- The approximability of multiple facility location on directed networks with random arc failures
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
- An improved algorithm for finding all upper boundary points in a stochastic-flow network
- Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic
- Capacity expansion and reliability evaluation on the networks flows with continuous stochastic functional capacity
- 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
- The computational complexity of the reliability problem on distributed systems
- Chance-constrained optimization of reliable fixed broadband wireless networks
- Fast computation of bounds for two-terminal network reliability
- scientific article; zbMATH DE number 5896038 (Why is no real title available?)
- A combined decomposition-reduction approach to the K-terminal reliability of. stochastic networks
- scientific article; zbMATH DE number 3848612 (Why is no real title available?)
- Double resource optimization for a robust computer network subject to a transmission budget
- Interactive Reliability Analysis on a Microcomputer
- The value of information in stochastic maximum flow problems
- An adaptive zero-variance importance sampling approximation for static network dependability evaluation
- Power Indices in Spanning Connectivity Games
- Complexity of Network Reliability and Optimal Resource Placement Problems
- On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
- A Hostile model for network reliability analysis
- scientific article; zbMATH DE number 7375995 (Why is no real title available?)
- Linguistic performance evaluation for an ERP system with link failures
- Optimal coteries for rings and related networks
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
- 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
- Polynomial-time algorithms for multimarginal optimal transport problems with structure
- Fast reliability ranking of matchstick minimal networks
- On the reliability estimation of stochastic binary systems
- Uniformly optimally reliable graphs: A survey
- EFFECT OF TRAFFIC DEMAND VARIATION ON ROAD NETWORK RESILIENCE
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- Factorization and exact evaluation of the source-terminal diameter-constrained reliability
- Simulation-based system reliability estimation of a multi-state flow network for all possible demand levels
- A reliability prediction model for a multistate cloud/edge-based network based on a deep neural network
- An FPRAS for two terminal reliability in directed acyclic graphs
- Degree-based approximations for network reliability polynomials
- Reliability evaluation of multi-state systems under cost consideration
- Reliability evaluation for multi-state network with cloud and fog computing by considering all transmission mechanisms
- Network reliability analysis on casualty rescue for natural disaster evaluation
- Path survival reliabilities as measures of reliability for lifeline utility networks
- An optimization-based Monte Carlo method for estimating the two-terminal survival signature of networks with two component classes
- Algorithms for the determination of cutsets in a hypergraph
This page was built for publication: Computational Complexity of Network Reliability Analysis: An Overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3738890)
