Pages that link to "Item:Q2448852"
From MaRDI portal
The following pages link to The complexity of computing the 2-K-reliability in networks (Q2448852):
Displaying 4 items.
- Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems. (Q1422361) (← links)
- Full complexity analysis of the diameter-constrained reliability (Q2806430) (← links)
- On computing the 2‐diameter ‐constrained <i>K</i> ‐reliability of networks (Q4921254) (← links)
- An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks (Q5288661) (← links)