Network Resilience
From MaRDI portal
Publication:3801061
DOI10.1137/0608033zbMath0654.68035OpenAlexW2914934867MaRDI QIDQ3801061
Publication date: 1987
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0608033
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Related Items (12)
Sixty years of network reliability ⋮ Optimizing Network Topology for Cascade Resilience ⋮ Expected rank in antimatroids ⋮ Expected rank and randomness in rooted graphs ⋮ The optimal unicyclic graphs for pair-connected reliability ⋮ On roots of Wiener polynomials of trees ⋮ On the roots of Wiener polynomials of graphs ⋮ Expected value expansions in rooted graphs ⋮ MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS ⋮ New expected value expansions of rooted graphs ⋮ Analysis and synthesis problems for network resilience ⋮ Cutting numbers for the forward loop backward hop network
Cites Work
- Unnamed Item
- Optimal algorithms for sensitivity analysis in associative multiplication problems
- Topology of series-parallel networks
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Steiner trees, partial 2–trees, and minimum IFI networks
- Calculating bounds on reachability and connectedness in stochastic networks
- Optimum Communication Spanning Trees in Series-Parallel Networks
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- Generalized steiner problem in series-parallel networks
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
- Network reliability analysis: Part I
This page was built for publication: Network Resilience
