Reliability of communication networks with delay constraints: computational complexity and complete topologies
From MaRDI portal
Recommendations
- On computing the 2-diameter-constrained \(K\)-reliability of networks
- Publication:4329144
- Diameter constrained reliability of ladders and Spanish fans
- Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
- Full complexity analysis of the diameter-constrained reliability
Cited in
(12)- Diameter constrained reliability: complexity, distinguished topologies and asymptotic behavior
- scientific article; zbMATH DE number 3984540 (Why is no real title available?)
- Diameter constrained reliability of ladders and Spanish fans
- The complexity of computing the 2-K-reliability in networks
- scientific article; zbMATH DE number 1735793 (Why is no real title available?)
- Factorization and exact evaluation of the source-terminal diameter-constrained reliability
- On computing the 2-diameter-constrained \(K\)-reliability of networks
- Full complexity analysis of the diameter-constrained reliability
- A note on bounding \(k\)-terminal reliability
- Computing diameter constrained reliability of a network with junction points
- A parallel method for reliability calculation of diameter constrained networks
- On the characterization of the domination of a diameter-constrained network reliability model
This page was built for publication: Reliability of communication networks with delay constraints: computational complexity and complete topologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774774)
