Dekel Tsur
Senior Academic
Succinct data structures for nearest colored node in a tree
We give succinct data structures that store a tree with colors on the nodes. Given a node x and a color α the structures find the nearest node to x with color α. Our results improve the O(nlogn)-bits structure of Gawrychowski et al. (2016) [12].
| Publication language | English |
| Pages | 6-10 |
| Journal | Information Processing Letters |
| Volume | 132 |
| Publication status | Published - 01.04.2018 |
Keywords
Colored trees
Labeled trees
Succinct data structures
ASJC Scopus subject areas
Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications
