✦ LIBER ✦

Ultra-succinct representation of ordered trees with applications

✍ Scribed by Jesper Jansson; Kunihiko Sadakane; Wing-Kin Sung

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Representation of ordered trees

✍ A. V. Anisimov; I. V. Karpenko; V. V. Krizhanovskii 📂 Article 📅 1981 🏛 Springer US 🌐 English ⚖ 623 KB

Succinct Representation of Balanced Pare

✍ Munro, J. Ian; Raman, Venkatesh 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 163 KB

Succinct representations of weighted tre

✍ Patil, Manish; Shah, Rahul; Thankachan, Sharma V. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 185 KB

The computational complexity of graph pr

✍ M. Karpinski; K. W. Wagner 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 451 KB

Internal path length of the binary repre

✍ Wen-Chin Chen; Wen-Chun Ni 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Efficient enumeration of ordered trees w

✍ Katsuhisa Yamanaka; Yota Otachi; Shin-ichi Nakano 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 383 KB