Network reliability: Heading out on the highway

DOI10.1002/net.21977zbMath1528.90087OpenAlexW3049700057MaRDI QIDQ6087070

Danielle Cox, Christina Graves, Jason I. Brown, Charles J. Colbourn, L. A. S. Mól

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

networkgraphreliabilityfixed pointdigraphmatroidcoherent systemrootreliability polynomialinflection pointoptimal graph

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Cites Work

• A reliability-improving graph transformation with applications to network reliability
• Algorithms for K-terminal reliability problems with node failures
• Roots of the Reliability Polynomials
• On the Computational Complexity of Combinatorial Problems
• Science and Statistics
• A fast algorithm for reliability calculations in sparse networks
• Bounding distributions for a stochastic pert network
• Transformations for simplifying network reliability calculations
• A decomposition algorithm for network reliability analysis
• Matroids and a Reliability Analysis Problem
• The probabilistic longest path problem
• Optimum requirement spanning trees and reliability of tree networks
• Location of Zeros of Chromatic and Related Polynomials of Graphs
• On stochastic spanning tree problem
• On reliability of graphs with node failures
• A proof of Boesch's conjecture
• Exact reliabilities of most reliable double-loop networks
• The structure of max ?-minm?+1 graphs used in the design of reliable networks
• (K, j)-domination and (K, j)-reliability
• Boolean Normal Forms, Shellability, and Reliability Computations
• Zeros of Reliability Polynomials and f-vectors of Matroids
• Uniformly optimally reliable graphs
• Stochastic maximum weight forest problem
• Detecting resilient structures in stochastic networks: A two‐stage stochastic optimization approach
• A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
• On the roots of the node reliability polynomial
• Nonexistence of optimal graphs for all terminal reliability
• Inflection points of reliability polynomials are dense in [0,1]
• Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
• Optimal response to epidemics and cyber attacks in networks
• On a Random Walk Survivability problem with arc failures and memory
• Reliability polynomials having arbitrarily many inflection points
• Connectedness of digraphs and graphs under constraints on the conditional diameter
• The strongly connected reliability of complete digraphs
• On uniformly most reliable two‐terminal graphs
• Disjoint (s, t)‐cuts in a network
• Directed network reliability: Domination and computing coefficients of the success‐marginal expansion
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• Network reliability and the factoring theorem
• Exact calculation of computer network reliability
• A polynomial-time algorithm to find shortest paths with recourse
• Threshold reliability of networks with small failure sets
• Monte Carlo and Markov Chain techniques for network reliability and sampling
• Consecutive cuts and paths, and bounds on k‐terminal reliability
• A forbidden minor characterization and reliability of a class of partial 4‐trees
• The intractability of the reliable assignment problem in split networks
• Reliability analysis of tree‐based networks and its application to fault‐tolerant VLSI systems
• Network design with probabilistic capacities
• Network transformations and bounding network reliability
• On the star—delta transformation in network reliability
• Shortest paths in stochastic networks with ARC lengths having discrete distributions
• On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
• Renormalization of two—terminal reliability
• Optimization of the reliability polynomial in presence of mediocre elements
• Reliability evaluation and decision problems in extra stage shuffle‐exchange MINs
• Multiterminal resilience for series‐parallel networks
• Connectedness of finite distance graphs
• Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
• Wye-Delta Transformation in Probablilistic Networks
• A Note on the Reliability of Communication Networks
• Coherent Structures of Non-Identical Components
• Best Possible Inequalities for the Probability of a Logical Function of Events
• State‐space partition techniques for multiterminal flows in stochastic networks
• Random Graphs
• Shortest Paths in Probabilistic Graphs
• Approximations to System Reliability Using a Modular Decomposition
• Optimal design of centralized computer networks
• Modules of Coherent Binary Systems
• Network reliability analysis: Part I
• Combinatorial Algebra and Random Graphs
• Recursive analysis of network reliability
• Reliable circuits using less reliable relays
• A randomized approximation algorithm for probabilistic inference on bayesian belief networks
• On the existence of uniformly optimally reliable networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average reliability of a graph
• \( h\)-vectors of matroids and logarithmic concavity
• The Brown-Colbourn conjecture on zeros of reliability polynomials is false
• On the unimodality of independence polynomials of some graphs
• The \(f\)-vector of a representable-matroid complex is log-concave
• The roots of the independence polynomial of a clawfree graph
• Chip firing and all-terminal network reliability bounds
• The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• Generating the states of a binary stochastic system
• The independence fractal of a graph.
• Reliability polynomials and their asymptotic limits for families of graphs
• Sixty years of network reliability
• Hodge theory for combinatorial geometries
• On the unimodality of independence polynomials of very well-covered graphs
• The shape of node reliability
• Log-concavity of characteristic polynomials and the Bergman fan of matroids
• On the reliability roots of simplicial complexes and matroids
• Classes of uniformly most reliable graphs for all-terminal reliability
• Central limit theorems from the roots of probability generating functions
• On the roots of all-terminal reliability polynomials
• The early days ofNetworks
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Computing the probability distribution of project duration in a PERT network
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• A survey of some network reliability analysis and synthesis results
• On the roots of strongly connected reliability polynomials
• The β-reliable minimax and maximin location problems on a network with probabilistic weights
• The diameter and connectivity of networks with random dependent faults
• A mean-variance model for the minimum cost flow problem with stochastic arc costs
• High-confidence estimation of small s -t reliabilities in directed acyclic networks
• Reliability and Maintenance
• The most likely path on series-parallel networks
• Most reliable double loop networks in survival reliability
• Sensitivity analysis in stochastic flow networks using the Monte Carlo method
• Minimizing a stochastic maximum-reliability path
• On the construction of optimally reliable graphs
• Efficient algorithms for computing the reliability of permutation and interval graphs
• On the design of reliable networks
• Multi-Component Systems and Structures and Their Reliability
• A Survey of Network Reliability and Domination Theory
• Bounds on expected performance of networks with links subject to failure
• Network reliability and acyclic orientations
• Uniformly-most reliable networks do not always exist
• Reliability of interconnection networks modeled by a product of graphs
• Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations
• Uniformly optimal digraphs for strongly connected reliability
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Combining monte carlo estimates and bounds for network reliability
• The probabilistic minimum spanning tree problem
• Reliability of interconnection networks modeled by Cartesian product digraphs
• Calculating bounds on reachability and connectedness in stochastic networks
• Note on independence of arcs in antiparallel for network flow problems
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Network reliability analysis using 2-connected digraph reductions
• The most reliable series-parallel networks
• A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability
• Polyhedral Combinatorics and Network Reliability
• Synthesis of reliable networks - a survey
• Algebraic Methods Applied to Network Reliability Problems
• Optimally reliable graphs for both edge and vertex failures
• Iterative algorithms for generating minimal cutsets in directed graphs
• On a property of cyclic covers ofp-graphs
• A random network model of message transmission
• An algorithm for reliability analysis of planar graphs
• Improving reliability bounds in computer networks
• First-and second-order bounds on terminal reliability
• Shortest paths in networks with exponentially distributed arc lengths
• Node partition formula for directed graph reliability
• A monte carlo sampling plan for estimating reliability parameters and related functions
• Minimal spanning trees in undirected networks with exponentially distributed arc weights
• Stochastic shortest paths with recourse
• Domination theory and the crapo β-invariant
• Multiplicative improvements in network reliability bounds
• Triconnected decomposition for computingK-terminal network reliability
• The Complexity of Enumeration and Reliability Problems
• Maximal expected flow in a network subject to arc failures
• A theorem concerning cyclic directed graphs with applications to network reliability
• Complexity of network reliability computations
• A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
• Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
• Combinatorial properties of directed graphs useful in computing network reliability
• Graphs as models of communication network vulnerability: Connectivity and persistence
• Modular decomposition and reliability computation in stochastic transportation networks having cutnodes
• On reliability in stochastic graphs
• Maximum flow in networks with a small number of random arc capacities
• Polynomial algorithms for estimating network reliability
• On graphs with randomly deleted edges
• Least reliable networks and the reliability domination
• Resilience of partialk-tree networks with edge and node failures
• Reliability covering problems
• On the nonexistence of uniformly optimal graphs for pair-connected reliability
• On dependence and reliability computations
• Computing rooted communication reliability in an almost acyclic digraph
• Characterizing stochastic flow networks using the monte carlo method
• Maximum flows in probabilistic networks