Combinatorial aspects of network reliability

DOI10.1007/BF02061656zbMath0736.90035OpenAlexW2009879748MaRDI QIDQ1179727

Charles J. Colbourn

Publication date: 27 June 1992

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

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

zbMATH Keywords

network reliabilityexact algorithmsbounding methodscomplexity of reliability computationsMonte Carlo strategies

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Mincut ideals of two-terminal networks, Counting and sampling minimum cuts in genus \(g\) graphs, The Number of Labeled Connected Graphs Modulo Prime Powers, Counting and sampling minimum \((s,t)\)-cuts in weighted planar graphs in polynomial time, Integrating and Sampling Cuts in Bounded Treewidth Graphs

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