Search for MC in modified networks
From MaRDI portal
Publication:5926035
DOI10.1016/S0305-0548(00)00046-0zbMath0990.90009WikidataQ126982917 ScholiaQ126982917MaRDI QIDQ5926035
Publication date: 12 March 2001
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
Related Items
An Improved Vectorization Algorithm to Solve the d-MP Problem, Search for all \(d\)-mincuts of a limited-flow network, A simple algorithm to search for all MCs in networks
Cites Work
- Unnamed Item
- Reliability Bounds for Multistate Systems with Multistate Components
- Reliability Evaluation of Multistate Systems with Multistate Components
- Computational Complexity of Network Reliability Analysis: An Overview
- The Complexity of Enumeration and Reliability Problems
- An Efficient Computational Technique for Evaluating the Cut/Tie Sets and Common-Cause Failures of Complex Systems
- An Efficient Algorithm for Deducing the Minimal Cuts and Reliability Indices of a General Network Configuration