Fast computation of bounds for two-terminal network reliability
From MaRDI portal
Recommendations
- Practical sequential bounds for approximating two-terminal reliability
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- First-and second-order bounds on terminal reliability
- Series-Parallel Bounds for the Two-Terminal Reliability Problem
- A dynamic bounding algorithm for approximating multi-state two-terminal reliability
Cites work
- A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
- A fully dynamic algorithm for distributed shortest paths.
- A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
- A Monte Carlo Sampling Plan for Estimating Network Reliability
- A New Algorithm for Symbolic System Reliability Analysis
- A new implementation of Yen's ranking loopless paths algorithm
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- A Reliability Bound for Systems of Maintained, Interdependent Components
- A sum of disjoint products algorithm for reliability evaluation of flow networks
- A survey of efficient reliability computation using disjoint products approach
- Algorithms for Generating Minimal Cutsets by Inversion
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Bounding network-reliability using consecutive minimal cutsets
- Bounds on the reliability of binary coherent systems
- Calculating bounds on reachability and connectedness in stochastic networks
- Computational Complexity of Network Reliability Analysis: An Overview
- Edge-packings of graphs and network reliability
- Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph
- Estimation of network reliability using graph evolution models
- Experimental results on preprocessing of path/cut terms in sim of disjoint products technique
- Finding the K Shortest Loopless Paths in a Network
- Finding the k Shortest Paths
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Graph-Based Algorithms for Boolean Function Manipulation
- High-confidence estimation of small s-t reliabilities in directed acyclic networks
- scientific article; zbMATH DE number 4080704 (Why is no real title available?)
- scientific article; zbMATH DE number 49666 (Why is no real title available?)
- Introduction to algorithms.
- Network reliability and the factoring theorem
- Network Reliability Assessment through Empirical Models Using a Machine Learning Approach
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs
- Practical sequential bounds for approximating two-terminal reliability
- Recursive Disjoint Products: A Review of Three Algorithms
- Reliability Bounds for Multistate Systems with Multistate Components
- Reliability of directed networks using the factoring theorem
- Sequential Destruction Method for Monte Carlo Evaluation of System Reliability
- Series-Parallel Bounds for the Two-Terminal Reliability Problem
- Simulation methods for reliability and availability of complex systems
- Smaller sums of disjoint products by subproduct inversion
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(11)- Lower bounds on two-terminal network reliability
- Evaluations of quantiles of system lifetime distributions
- Fast simulation of highly reliable networks with varying random external load
- A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks
- Practical sequential bounds for approximating two-terminal reliability
- First-and second-order bounds on terminal reliability
- Multiplicative improvements in network reliability bounds
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- Computing diameter constrained reliability of a network with junction points
- Degree-based approximations for network reliability polynomials
- An optimization-based Monte Carlo method for estimating the two-terminal survival signature of networks with two component classes
This page was built for publication: Fast computation of bounds for two-terminal network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296891)
