Pages that link to "Item:Q1422361"
From MaRDI portal
The following pages link to Linear-time algorithms for computing the reliability of bipartite and (\(\# \leqslant 2\)) star distributed computing systems. (Q1422361):
Displaying 4 items.
- The computational complexity of the reliability problem on distributed systems (Q287259) (← links)
- A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems (Q1130399) (← links)
- The disributed program reliability analysis on star topologies (Q1968587) (← links)
- Computing the \(K\)-terminal reliability of directed path graphs (Q2348708) (← links)