Simple and Efficient Fully-Functional Succinct Trees
Data Structures and Algorithms
2016-03-24 v2
Abstract
The fully-functional succinct tree representation of Navarro and Sadakane (ACM Transactions on Algorithms, 2014) supports a large number of operations in constant time using bits. However, the full idea is hard to implement. Only a simplified version with operation time has been implemented and shown to be practical and competitive. We describe a new variant of the original idea that is much simpler to implement and has worst-case time for the operations. An implementation based on this version is experimentally shown to be superior to existing implementations.
Keywords
Cite
@article{arxiv.1601.06939,
title = {Simple and Efficient Fully-Functional Succinct Trees},
author = {Joshimar Cordova and Gonzalo Navarro},
journal= {arXiv preprint arXiv:1601.06939},
year = {2016}
}