Series-Parallel Bounds for the Two-Terminal Reliability Problem
From MaRDI portal
Publication:4020657
Recommendations
- Improving reliability bounds in computer networks
- Practical sequential bounds for approximating two-terminal reliability
- Lower bounds on two-terminal network reliability
- A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
- scientific article; zbMATH DE number 4097115
Cited in
(18)- Enhancing the consecutive cuts bound for network reliability
- Fast computation of bounds for two-terminal network reliability
- Bounds of two-terminal network reliability and base spectrum of network graph
- Consecutive cuts and paths, and bounds on k‐terminal reliability
- A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
- Best second order bounds for two-terminal network reliability with dependent edge failures
- scientific article; zbMATH DE number 1472180 (Why is no real title available?)
- scientific article; zbMATH DE number 205333 (Why is no real title available?)
- Edge-packings of graphs and network reliability
- Computing 2-terminal reliability for radio-broadcast networks
- A note on bounding \(k\)-terminal reliability
- Limit reliability functions of some series-parallel and parallel-series systems
- Combinatorial aspects of network reliability
- scientific article; zbMATH DE number 4045783 (Why is no real title available?)
- Practical sequential bounds for approximating two-terminal reliability
- Multiterminal resilience for series‐parallel networks
- Network reliability: Numbers or insight? (A discussion paper)
- scientific article; zbMATH DE number 4097115 (Why is no real title available?)
This page was built for publication: Series-Parallel Bounds for the Two-Terminal Reliability Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020657)