𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some statistical properties of the minimum spanning forest

✍ Scribed by V. Di Gesù; B. Sacco


Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
415 KB
Volume
16
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


The expected complexity of Prim's minimu
✍ Chip Martel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

We study the expected performance of Prim's minimum spanning tree (MST) algorithm implemented using ordinary heaps. We show that this implementation runs in linear or almost linear expected time on a wide range of graphs. This helps to explain why Prim's algorithm often beats MST algorithms which ha