Fast computation of bounds for two-terminal network reliability (Q296891): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2014.04.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008750370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Series-Parallel Bounds for the Two-Terminal Reliability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Network Reliability Analysis: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating bounds on reachability and connectedness in stochastic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the reliability of binary coherent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation methods for reliability and availability of complex systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic algorithm for distributed shortest paths. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-packings of graphs and network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Destruction Method for Monte Carlo Evaluation of System Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of network reliability using graph evolution models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the k Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reliability Bound for Systems of Maintained, Interdependent Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial factoring: an efficient algorithm for approximating two-terminal reliability on complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte Carlo Sampling Plan for Estimating Network Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smaller sums of disjoint products by subproduct inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability Bounds for Multistate Systems with Multistate Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical sequential bounds for approximating two-terminal reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sum of disjoint products algorithm for reliability evaluation of flow networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Symbolic System Reliability Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Disjoint Products: A Review of Three Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new implementation of Yen's ranking loopless paths algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3810756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical bounding algorithm for computing two-terminal reliability based on decomposition technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability of directed networks using the factoring theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of efficient reliability computation using disjoint products approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Reliability Assessment through Empirical Models Using a Machine Learning Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network reliability and the factoring theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding network-reliability using consecutive minimal cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Generating Minimal Cutsets by Inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on preprocessing of path/cut terms in sim of disjoint products technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset / rank
 
Normal rank
Property / cites work
 
Property / cites work: A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>K</i> Shortest Loopless Paths in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-confidence estimation of small <i>s</i> -<i>t</i> reliabilities in directed acyclic networks / rank
 
Normal rank

Latest revision as of 05:12, 12 July 2024

scientific article
Language Label Description Also known as
English
Fast computation of bounds for two-terminal network reliability
scientific article

    Statements

    Fast computation of bounds for two-terminal network reliability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 June 2016
    0 references
    binary decision diagram (BDD)
    0 references
    bounds computation
    0 references
    large network reliability
    0 references
    reliability graph
    0 references
    reliability prediction
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references