✦ LIBER ✦

A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees

✍ Scribed by Garay, Juan A.; Kutten, Shay; Peleg, David

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Distributed Algorithm for Minimum Weig

✍ Humblet, P. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 700 KB

Approximating the Minimum Spanning Tree

✍ Chazelle, Bernard; Rubinfeld, Ronitt; Trevisan, Luca 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 168 KB

Estimating the Weight of Metric Minimum

✍ Czumaj, Artur; Sohler, Christian 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 266 KB

A linear-time optimal-message distribute

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

A fast distributed approximation algorit

✍ Maleq Khan; Gopal Pandurangan 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 271 KB

Incremental distributed asynchronous alg

✍ Yung H. Tsin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 459 KB