✦ LIBER ✦

An O(log n) algorithm for parallel update of minimum spanning trees

✍ Scribed by Shaunak Pawagi; I.V. Ramakrishnan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(log m) parallel algorithm for the m

✍ Francis Suraweera; Prabir Bhattacharya 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 481 KB

An O(log n) parallel algorithm for const

✍ Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Algorithms for finding and updating mini

✍ Pranay Chaudhuri; Asad A. Ismaeel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 564 KB

An adaptive and cost-optimal parallel al

✍ S. G. Akl 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 388 KB

An Algorithm for Finding K Minimum Spann

✍ Katoh, N.; Ibaraki, T.; Mine, H. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 964 KB

Parallel algorithms for computing maxima

✍ Hermann Jung; Kurt Mehlhorn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 726 KB