✦ LIBER ✦

An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification*

✍ Scribed by Seth Pettie†

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A minimum spanning tree algorithm with i

✍ Chazelle, Bernard 📂 Article 📅 2000 🏛 Association for Computing Machinery 🌐 English ⚖ 149 KB

An Unconditional Lower Bound on the Time

✍ Elkin, Michael 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 330 KB