✦ LIBER ✦

Optimal parallel verification of minimum spanning trees in logarithmic time

✍ Scribed by B. Dixon; R. E. Tarjan

Book ID: 110547442
Publisher: Springer
Year: 1997
Tongue: English
Weight: 577 KB
Volume: 17
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf02523235

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal representation of the minimum sp

Optimal representation of the minimum spanning tree algorithm in associative parallel processors

✍ A. Sh. Nepomnyashchaya 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 613 KB

Estimating the Weight of Metric Minimum

Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time

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

Approximating the Weight of the Euclidea

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

✍ Czumaj, Artur; Ergün, Funda; Fortnow, Lance; Magen, Avner; Newman, Ilan; Rubinfe 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 253 KB

The Optimality of Distributive Construct

The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors

✍ Korach, E.; Moran, S.; Zaks, S. 📂 Article 📅 1987 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 744 KB