An Improved Succinct Representation for Dynamic k-ary Trees

@inproceedings{Arroyuelo2008AnIS,
  title={An Improved Succinct Representation for Dynamic k-ary Trees},
  author={Diego Arroyuelo},
  booktitle={CPM},
  year={2008}
}
k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space consuming, and hence only relatively small trees can be kept in main memory. Nowadays, however, many applications need to store a huge amount of information. In this paper we present a succinct representation for dynamic k-ary trees of n nodes, requiring 2n + n log k + o(n log k) bits of space, which is close to the information… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…