Network Resilience

DOI10.1137/0608033MaRDI QIDQ3801061zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn

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

zbMATH Keywords

network reliabilitynetwork resilienceplanar networkseries- parallel networks{\#}P-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Publication:4206399
• Multiterminal resilience for series‐parallel networks
• Comments on "Network resilience: a measure of network fault tolerance" [with reply]
• Resilience of partialk-tree networks with edge and node failures
• The Complexity of the Residual Node Connectedness Reliability Problem

Cites work

• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• Calculating bounds on reachability and connectedness in stochastic networks
• Generalized steiner problem in series-parallel networks
• scientific article; zbMATH DE number 4094838 (Why is no real title available?)
• Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
• Network reliability analysis: Part I
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
• Optimal algorithms for sensitivity analysis in associative multiplication problems
• Optimum Communication Spanning Trees in Series-Parallel Networks
• Steiner trees, partial 2–trees, and minimum IFI networks
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• Topology of series-parallel networks

Cited in

(24)

• The optimal unicyclic graphs for pair-connected reliability
• Analysis and synthesis problems for network resilience
• Cutting numbers for the forward loop backward hop network
• Expected rank in antimatroids
• Sixty years of network reliability
• Expected value expansions in rooted graphs
• Network resilience
• Resilience and reliability analysis of P2P network systems
• On roots of Wiener polynomials of trees
• New expected value expansions of rooted graphs
• Expected rank and randomness in rooted graphs
• Network reinforcement
• Optimizing network topology for cascade resilience
• An SRN-based resiliency quantification approach
• MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS
• Resilience of partialk-tree networks with edge and node failures
• scientific article; zbMATH DE number 4126698 (Why is no real title available?)
• Comments on "Network resilience: a measure of network fault tolerance" [with reply]
• The vertex attack tolerance of complex networks
• Multiterminal resilience for series‐parallel networks
• Risk‐averse optimization and resilient network flows
• The average expected value of a rooted graph, Monte Carlo calculation, and a power index for the voting game
• On the roots of Wiener polynomials of graphs
• Resilient network admission control

This page was built for publication: Network Resilience

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801061)