Bounding network-reliability using consecutive minimal cutsets
From MaRDI portal
Recommendations
Cited in
(21)- Edge-packings of graphs and network reliability
- Combinatorial aspects of network reliability
- A note on bounding \(k\)-terminal reliability
- Network reliability and the probabilistic estimation of damage from fire spread
- Enhancing the consecutive cuts bound for network reliability
- Fast computation of bounds for two-terminal network reliability
- An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
- The reliability of systems with stair-type consecutive minimal cuts
- Calculating bounds on reachability and connectedness in stochastic networks
- A New Technique in Minimal Path and Cutset Evaluation
- Bounds on the Reliability of Networks
- Reliability of Systems with Consecutive Minimal Cutsets
- Minimal paths and cuts of networks exposed to common-cause failures
- Bounding the Reliability of Networks
- scientific article; zbMATH DE number 176260 (Why is no real title available?)
- scientific article; zbMATH DE number 205333 (Why is no real title available?)
- Consecutive cuts and paths, and bounds on k‐terminal reliability
- scientific article; zbMATH DE number 857424 (Why is no real title available?)
- scientific article; zbMATH DE number 975420 (Why is no real title available?)
- Mincut ideals of two-terminal networks
- Network reliability: Numbers or insight? (A discussion paper)
This page was built for publication: Bounding network-reliability using consecutive minimal cutsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778523)