Craig Dillabaugh, Meng He, Anil Maheshwari. Succinct and I/O Efficient Data Structures for Traversal in Trees. Algorithmica, 63(1-2):201-223, 2012. [doi]
@article{DillabaughHM12,
title = {Succinct and I/O Efficient Data Structures for Traversal in Trees},
author = {Craig Dillabaugh and Meng He and Anil Maheshwari},
year = {2012},
doi = {10.1007/s00453-011-9528-z},
url = {http://dx.doi.org/10.1007/s00453-011-9528-z},
researchr = {https://researchr.org/publication/DillabaughHM12},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {201-223},
}