✦ LIBER ✦

An Online Algorithm for the Dynamic Maximal Dense Tree Problem

✍ Scribed by B. Awerbuch and T. Singh

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A randomized NC algorithm for the maxima

✍ Zhi-Zhong Chen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 769 KB

A dynamic programming algorithm for the

✍ C.E. Ferreira; A.S. Freire; G.A. Puglia 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 184 KB

An O(EVIog2V) algorithm for the maximal

✍ Zvi Galil; Amnon Naamad 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 934 KB

A dynamic programming algorithm for the

✍ Jennifer A. Horne; J. Cole Smith 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

An improved approximation algorithm for

✍ Guohui Lin; Randy Goebel; Zhong Li; Lusheng Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 196 KB

An exact algorithm for the Maximum Leaf

✍ Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedlof 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 313 KB