✦ LIBER ✦

An O(n×log(n)) algorithm to compute the all-terminal reliability of (K5, K 2.2.2) free networks

✍ Scribed by Politof, T.; Satyanarayana, A.; Tung, L.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O (n · log(n)) algorithm to compute t

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 106 KB

An O(k2·log(n)) algorithm for computing

✍ Min-Sheng Lin 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 142 KB

An O(n·(log2(n))2) algorithm for computi

✍ Belfore, L.A., II 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 428 KB

Derivation of an O(k2 log n) algorithm f

✍ Alberto Pettorossi 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 838 KB

An O(n·(log2(n))2) algorithm for computi

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

An efficient algorithm for generating al

✍ Ichiro Semba 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 127 KB