Sixty years of network reliability
From MaRDI portal
Graph polynomials (05C31) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of graph theory to circuits and networks (94C15)
Recommendations
Cites work
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- A linear-time algorithm to compute the reliability of planar cube-free networks
- A survey on multi-loop networks.
- A survey on undirected circulant graphs
- Bounds on the Reliability Polynomial for Shellable Independence Systems
- Calculating bounds on reachability and connectedness in stochastic networks
- Combinatorial approaches to Monte Carlo estimation of network lifetime distribution
- Diameter constrained reliability of ladders and Spanish fans
- Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
- Diameter vulnerability of graphs
- Edge-packings of graphs and network reliability
- Effective graph resistance
- Efficient algorithms for reliability analysis of planar networks - a survey
- Exact reliabilities of most reliable double-loop networks
- Extremal connectivity and vulnerability in graphs
- Factoring Algorithms for Computing K-Terminal Network Reliability
- Factoring and reductions for networks with imperfect vertices
- Factorization of network reliability with perfect nodes. I: Introduction and statements
- Factorization of network reliability with perfect nodes. II: Connectivity matrix
- Full complexity analysis of the diameter-constrained reliability
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 49666 (Why is no real title available?)
- scientific article; zbMATH DE number 1324671 (Why is no real title available?)
- scientific article; zbMATH DE number 1735793 (Why is no real title available?)
- scientific article; zbMATH DE number 919112 (Why is no real title available?)
- scientific article; zbMATH DE number 1444280 (Why is no real title available?)
- Lower bounds on two-terminal network reliability
- Models of network reliability. Analysis, combinatorics, and Monte Carlo.
- Monte-Carlo algorithms for the planar multiterminal network reliability problem
- Most reliable double loop networks in survival reliability
- Network reliability analysis: Part I
- Network reliability and the factoring theorem
- Network Resilience
- Network robustness under large-scale attacks
- Old and new results on algebraic connectivity of graphs
- On optimal system designs in reliability-economics frameworks
- On reliability in stochastic graphs
- On reliability indices of communication networks
- On reliability of graphs with node failures
- On reliability of the folded hypercubes
- On the construction of optimally reliable graphs
- On the nonexistence of uniformly optimal graphs for pair-connected reliability
- On the roots of the node reliability polynomial
- On Uniformly Optimal Networks: A Reversal of Fortune?
- On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
- Optimally reliable graphs for both edge and vertex failures
- Optimally Reliable Graphs for Both Vertex and Edge Failures
- Optimally reliable networks
- Reliabilities of chordal rings
- Reliabilities of Double-Loop Networks
- Reliability polynomials can cross twice
- Reliable circuits using less reliable relays
- Some problems of network reliability analysis
- Spanning tree results for graphs and multigraphs. A matrix-theoretic approach
- Survival reliability of some double-loop networks and chordal rings
- System signatures and their applications in engineering reliability
- Ternary networks. Reliability and Monte Carlo
- The average reliability of a graph
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- The Computational Complexity of Tutte Invariants for Planar Graphs
- Topological optimization of reliable networks under dependent failures
- Toughness of graphs and the existence of factors
- Uniformly optimal digraphs for strongly connected reliability
- Uniformly optimal graphs in some classes of graphs with node failures
Cited in
(11)- Network reliability in Hamiltonian graphs
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
- Reliability evaluation of subsystem based on exchanged hypercube
- VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
- Exact reliability optimization for series‐parallel graphs using convex envelopes
- On the reliability estimation of stochastic binary systems
- Network reliability: Heading out on the highway
- More reliable graphs are not always stronger
- Degree-based approximations for network reliability polynomials
- Path survival reliabilities as measures of reliability for lifeline utility networks
- Parallel computing the diameter constrained reliability of networks using supercomputers with distributed memory
This page was built for publication: Sixty years of network reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1616159)
