✦ LIBER ✦

Succinct representations of weighted trees supporting path queries

✍ Scribed by Patil, Manish; Shah, Rahul; Thankachan, Sharma V.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ultra-succinct representation of ordered

✍ Jesper Jansson; Kunihiko Sadakane; Wing-Kin Sung 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Succinct Representation of Balanced Pare

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

Bounds on the weighted path length of bi

✍ J. Nievergelt; J. Pradels; C.K. Wong; P.C. Yue 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 708 KB

A Best Possible Bound for The Weighted P

✍ Mehlhorn, Kurt 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 366 KB

Internal path length of the binary repre

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

Weighted solution path algorithm of supp

✍ Wentao Mao; Guirong Yan; Longlei Dong 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 649 KB