Network Resilience
- 1 July 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 8 (3) , 404-409
- https://doi.org/10.1137/0608033
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Complexity of Reliability Computations in Planar and Acyclic GraphsSIAM Journal on Computing, 1986
- Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel NetworksIEEE Transactions on Reliability, 1986
- Optimum Communication Spanning Trees in Series-Parallel NetworksSIAM Journal on Computing, 1985
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel NetworksSIAM Journal on Computing, 1985
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM Journal on Computing, 1983
- Calculating bounds on reachability and connectedness in stochastic networksNetworks, 1983
- Series‐parallel reduction for difficult measures of network reliabilityNetworks, 1981
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex NetworksIEEE Transactions on Reliability, 1978
- Network reliability analysis: Part INetworks, 1971
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965