✦ LIBER ✦

A randomized linear-time algorithm to find minimum spanning trees

✍ Scribed by Karger, David R.; Klein, Philip N.; Tarjan, Robert E.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Randomized Linear-Work EREW PRAM Algor

✍ Chung and Vijaya 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 72 KB

A linear-time algorithm for finding a mi

✍ Harold N. Gabow; Robert E. Tarjan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 460 KB

A linear-time optimal-message distribute

✍ Michalis Faloutsos; Mart Molle 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 250 KB

An algorithm for geometric minimum spann

✍ Kenneth L. Clarkson 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 427 KB

A linear-time algorithm to find modules

✍ Dutuit, Y.; Rauzy, A. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 376 KB

A Randomized Time-Work Optimal Parallel

✍ Pettie, Seth; Ramachandran, Vijaya 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 210 KB