SUCCINCT REPRESENTATION OF BALANCED PARENTHESES AND STATIC TREES.
Saved in:
| Title: | SUCCINCT REPRESENTATION OF BALANCED PARENTHESES AND STATIC TREES. |
|---|---|
| Authors: | Munro, J. Ian, Raman, Venkatesh |
| Source: | SIAM Journal on Computing. 2001, Vol. 31 Issue 3, p762. 15p. |
| Subjects: | Abstract data types (Computer science), Binary number system, Graphic methods, Research |
| Abstract: | We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses. Our representations use an amount of space within a lower order term of the information theoretic minimum and support, in constant time, a richer set of navigational operations than has previously been considered in similar work. In the case of binary trees, for instance, we can move from a node to its left or right child or to the parent in constant time while retaining knowledge of the size of the subtree at which we are positioned. The approach is applied to produce a succinct representation of planar graphs in which one can test adjacency in constant time. [ABSTRACT FROM AUTHOR] |
| Copyright of SIAM Journal on Computing is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
