Pages that link to "Item:Q1774774"
From MaRDI portal
The following pages link to Reliability of communication networks with delay constraints: computational complexity and complete topologies (Q1774774):
Displaying 8 items.
- Computing diameter constrained reliability of a network with junction points (Q649994) (← links)
- A note on bounding \(k\)-terminal reliability (Q1186804) (← links)
- The complexity of computing the 2-K-reliability in networks (Q2448852) (← links)
- On the characterization of the domination of a diameter-constrained network reliability model (Q2500537) (← links)
- Full complexity analysis of the diameter-constrained reliability (Q2806430) (← links)
- (Q3747697) (← links)
- On computing the 2‐diameter ‐constrained <i>K</i> ‐reliability of networks (Q4921254) (← links)
- Factorization and exact evaluation of the source-terminal diameter-constrained reliability (Q6496357) (← links)