Network reliability: Numbers or insight? (A discussion paper)

DOI10.1007/BF02061656zbMath0729.90676OpenAlexW2009879748MaRDI QIDQ806808

Charles J. Colbourn

Publication date: 1991

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02061656

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumeration of connected spanning subgraphs of a planar graph
• Matroid Steiner problems, the Tutte polynomial and network reliability
• Network reliability and the probabilistic estimation of damage from fire spread
• Computing Network Reliability in Time Polynomial in the Number of Cuts
• Combining monte carlo estimates and bounds for network reliability
• The Complexity of Reliability Computations in Planar and Acyclic Graphs
• Bounding network-reliability using consecutive minimal cutsets
• A monte carlo sampling plan for estimating reliability parameters and related functions
• Exact cuts in networks
• Series-Parallel Bounds for the Two-Terminal Reliability Problem
• Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
• Disjoint (s, t)‐cuts in a network
• Unranking and ranking spanning trees of a graph
• Wye-Delta Transformation in Probablilistic Networks
• The Computational Complexity of Tutte Invariants for Planar Graphs
• Locating A Broadcast Facility In An Unreliable Network