Craig Dillabaugh, Meng He, Anil Maheshwari. Succinct and I/O Efficient Data Structures for Traversal in Trees. In Seok-Hee Hong, Hiroshi Nagamochi, Takuro Fukunaga, editors, Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings. Volume 5369 of Lecture Notes in Computer Science, pages 112-123, Springer, 2008. [doi]
Abstract is missing.