Sixty years of network reliability
From MaRDI portal
Publication:1616159
DOI10.1007/s11786-018-0345-5zbMath1432.68045OpenAlexW2808798366WikidataQ129652601 ScholiaQ129652601MaRDI QIDQ1616159
Publication date: 1 November 2018
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-018-0345-5
Graph polynomials (05C31) Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (8)
A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ 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 ⋮ Reliability evaluation of subsystem based on exchanged hypercube ⋮ Network reliability in Hamiltonian graphs ⋮ VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The average reliability of a graph
- Effective graph resistance
- Diameter vulnerability of graphs
- Old and new results on algebraic connectivity of graphs
- On reliability of the folded hypercubes
- Factorization of network reliability with perfect nodes. I: Introduction and statements
- Factorization of network reliability with perfect nodes. II: Connectivity matrix
- On reliability indices of communication networks
- Uniformly optimal graphs in some classes of graphs with node failures
- Monte-Carlo algorithms for the planar multiterminal network reliability problem
- Edge-packings of graphs and network reliability
- Lower bounds on two-terminal network reliability
- Optimally reliable networks
- Reliability polynomials can cross twice
- Topological optimization of reliable networks under dependent failures
- Toughness of graphs and the existence of factors
- A survey on multi-loop networks.
- System signatures and their applications in engineering reliability
- Some problems of network reliability analysis
- Full complexity analysis of the diameter-constrained reliability
- On Uniformly Optimal Networks: A Reversal of Fortune?
- A SURVEY ON UNDIRECTED CIRCULANT GRAPHS
- Ternary Networks
- Spanning Tree Results for Graphs and Multigraphs
- Most reliable double loop networks in survival reliability
- Network Robustness under Large-Scale Attacks
- On the construction of optimally reliable graphs
- Factoring and reductions for networks with imperfect vertices
- Reliabilities of Double-Loop Networks
- Uniformly optimal digraphs for strongly connected reliability
- A linear-time algorithm to compute the reliability of planar cube-free networks
- On optimal system designs in reliability-economics frameworks
- Calculating bounds on reachability and connectedness in stochastic networks
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- Factoring Algorithms for Computing K-Terminal Network Reliability
- Efficient algorithms for reliability analysis of planar networks - a survey
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- Optimally reliable graphs for both edge and vertex failures
- Network Resilience
- Extremal connectivity and vulnerability in graphs
- On reliability in stochastic graphs
- On the nonexistence of uniformly optimal graphs for pair-connected reliability
- Reliabilities of chordal rings
- Optimally Reliable Graphs for Both Vertex and Edge Failures
- On reliability of graphs with node failures
- Exact reliabilities of most reliable double-loop networks
- Survival reliability of some double-loop networks and chordal rings
- On the roots of the node reliability polynomial
- Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
- Bounds on the Reliability Polynomial for Shellable Independence Systems
- Network reliability and the factoring theorem
- Combinatorial approaches to Monte Carlo estimation of network lifetime distribution
- Diameter constrained reliability of ladders and Spanish fans
- On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
- The Computational Complexity of Tutte Invariants for Planar Graphs
- Network reliability analysis: Part I
- Reliable circuits using less reliable relays
This page was built for publication: Sixty years of network reliability
