| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874220 | Information Processing Letters | 2018 | 10 Pages |
Abstract
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(nlogâ¡n)-bits structure of Gawrychowski et al. (2016) [12].
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dekel Tsur,