Succinct and I/O Efficient Data Structures for Traversal in Trees

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.