Analysis and synthesis problems for network resilience
type: Item
instance of: scholarly article
title: Analysis and synthesis problems for network resilience
zbMATH Open document ID: 0800.68629
DOI: 10.1016/0895-7177(93)90251-S
published in: Mathematical and Computer Modelling
publication date: 1994-12-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 475038
zbMATH Keywords: subgraph counting bounds
zbMATH Keywords: resilience networks
zbMATH Keywords: reliability
zbMATH Keywords: probabilistic graph
author: Charles J. Colbourn
MaRDI profile type: Publication
cites work: Synthesis of reliable networks - a survey
cites work: Network reliability analysis: Part I
cites work: A Unified Formula for Analysis of Some Network Reliability Problems
cites work: Computing Network Reliability in Time Polynomial in the Number of Cuts
cites work: Q4198056
cites work: Network Resilience
cites work: Random Graphs
cites work: A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
cites work: Lower bounds on two-terminal network reliability
cites work: Improving reliability bounds in computer networks
cites work: The most reliable series-parallel networks
cites work: Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
description: scientific article; zbMATH DE number 475038