Parallel preprocessing for path queries without concurrent reading
Information and Computation
A survey on tree edit distance and related problems
Theoretical Computer Science
Range mode and range median queries on lists and trees
Nordic Journal of Computing
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms (TALG)
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
A Uniform Approach Towards Succinct Representation of Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Universal Succinct Representations of Trees?
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Compressing and indexing labeled trees, with applications
Journal of the ACM (JACM)
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Theoretical Computer Science
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Adaptive searching in succinctly encoded binary relations and tree-structured documents
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Path queries in weighted trees
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Succinct ordinal trees based on tree covering
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Succinct representations of weighted trees supporting path queries
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Consider a tree T on n nodes, each having a weight drawn from [1..σ]. In this paper, we design succinct data structures to encode T using $n H(W_T) + o(n\lg \sigma)$ bits of space, such that we can support path counting queries in $O(\frac{\lg \sigma}{\lg\lg n} + 1)$ time, path reporting queries in $O((occ+1)(\frac{\lg \sigma}{\lg\lg n} + 1))$ time, and path median and path selection queries in $O(\frac{\lg \sigma}{\lg\lg \sigma})$ time, where H(WT) is the entropy of the multiset of the weights of the nodes in T. Our results not only improve the best known linear space data structures [15], but also match the lower bounds for these path queries [18,19,16] when $\sigma = \Omega(n / \textrm{polylog}(n))$.