Balanced Parentheses Strike Back
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 94 === Succinct representations for trees with efficient query support have been extensively studied. The best previously known result is due to Geary, Raman, and Raman [SODA 2004, pages 1-10]. The number of bits required by their representation for an n-node tree T is...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/23397291408019570727 |