✦ LIBER ✦

The complexity of computing the 2-K-reliability in networks

✍ Scribed by Canale, Eduardo; Cancela, Héctor; Robledo, Franco; Sartor, Pablo

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing the 2-diameter -constrained

✍ Eduardo Canale; Héctor Cancela; Franco Robledo; Gerardo Rubino; Pablo Sartor 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 753 KB

Decomposition Method for Computing the R

✍ Nakazawa, Hayao 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 598 KB

An O(n×log(n)) algorithm to compute the

✍ Politof, T.; Satyanarayana, A.; Tung, L. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 551 KB

Improving the reliability of computer co

✍ Shi Weigeng; Servatius Brigitte 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 800 KB

A new algorithm for computing the reliab

✍ Chi Hanzhong; Li Dongkui 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A memory-effective fast algorithm for co

✍ W.J. Rueger 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 352 KB