Analysis and synthesis problems for network resilience

DOI10.1016/0895-7177(93)90251-SzbMath0800.68629MaRDI QIDQ1310228

Charles J. Colbourn

Publication date: 4 December 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

reliabilityprobabilistic graphresilience networkssubgraph counting bounds

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Cutting numbers for the forward loop backward hop network

Cites Work

• Unnamed Item
• Lower bounds on two-terminal network reliability
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• The most reliable series-parallel networks
• Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
• Synthesis of reliable networks - a survey
• Improving reliability bounds in computer networks
• Network Resilience
• A Unified Formula for Analysis of Some Network Reliability Problems
• Random Graphs
• Network reliability analysis: Part I

This page was built for publication: Analysis and synthesis problems for network resilience