Calculating bounds on reachability and connectedness in stochastic networks

DOI10.1002/net.3230130210zbMath0569.68053OpenAlexW2159332695MaRDI QIDQ3686053

Michael O. Ball, J. Scott Provan

Publication date: 1983

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230130210

zbMATH Keywords

measures of network reliability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Sixty years of network reliability, An algorithm to generate the ideals of a partial order, Fast computation of bounds for two-terminal network reliability, Canonical cactus representation for miminum cuts, Threshold Channel Graphs, Edge-packings of graphs and network reliability, Lower bounds on two-terminal network reliability, Efficient generation of the ideals of a poset in Gray code order. II, Reliability analysis on the multiple-loop network, Counting almost minimum cutsets with reliability applications, Network reliability: Heading out on the highway, On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts, Unnamed Item, Network Resilience, Counting and sampling minimum cuts in genus \(g\) graphs, Generalized loop‐erased random walks and approximate reachability, Optimal cuts in graphs and statistical mechanics, On estimating the number of order ideals in partial orders, with some applications, A novel algorithm on network reliability estimation, Unnamed Item, Efficient generation of the ideals of a poset in Gray code order, Extracting maximal information about sets of minimum cuts, Expected value expansions in rooted graphs, Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time, A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability, Integrating and Sampling Cuts in Bounded Treewidth Graphs, Chip firing and all-terminal network reliability bounds, Sensitivity Analysis for the System Reliability Function, Evaluating Best-Case and Worst-Case Coefficients of Variation when Bounds Are Available, Domination of cyclic monotone \((s,t)\)-graphs, A compact hash function for paths in PERT networks, Gray codes from antimatroids

Cites Work

• On the structure of all minimum cuts in a network and applications
• Unnamed Item
• Unnamed Item