A Uniform Approach Towards Succinct Representation of Trees-Reference-Cited by-同舟云学术

A Uniform Approach Towards Succinct Representation of Trees

Published: Issue: Volume: Page:173-184
ISSN:0302-9743
Container-title:Algorithm Theory – SWAT 2008
language:
Short-container-title:

Author:

Farzan Arash,Munro J. Ian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-69903-3_17.pdf

Reference22 articles.

1. Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 680–689. ACM-SIAM, New York (2007)

2. Benoit, D., Demaine, E.D., Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Representing trees of higher degree. Algorithmica 43(4), 275–292 (2005)

3. Bernhart, F.R.: Catalan, motzkin, and riordan numbers. Discrete Mathematics 204, 72–112 (1999)

4. Clark, D.R.: Compact pat trees. PhD thesis, Waterloo, Ontario. Canada (1998)

5. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage (extended abstract). In: SODA, pp. 383–391 (1996)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Succinct Representations of Binary Trees;Mathematics in Computer Science;2017-03-20

2. A Practical Succinct Data Structure for Tree-Like Graphs;WALCOM: Algorithms and Computation;2015

3. Fully Functional Static and Dynamic Succinct Trees;ACM Transactions on Algorithms;2014-06

4. Succinct Representations of Ordinal Trees;Lecture Notes in Computer Science;2013

5. Compact Navigation and Distance Oracles for Graphs with Small Treewidth;Algorithmica;2012-11-28