Tree path majority data structures

DOI10.1016/j.tcs.2020.05.039zbMath1453.68062OpenAlexW3032951294MaRDI QIDQ784481

Gonzalo Navarro, Carlos Ochoa, Meng He, Travis Gagie

Publication date: 3 August 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/10016/

zbMATH Keywords

succinct data structuresmajorities on trees

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear-space data structures for range frequency queries on arrays and trees
• Succinct representation of labeled trees
• A framework for succinct labeled ordinal trees over large alphabets
• Linear-space data structures for range minority query in arrays
• The level ancestor problem simplified
• Computing on a free tree via complexity-preserving mappings
• Finding repeated elements
• Path queries on functions
• A data structure for dynamic trees
• Linear-space data structures for range mode query in arrays
• Succinct indices for path minimum, with applications
• Fully Functional Static and Dynamic Succinct Trees
• Better Space Bounds for Parameterized Range Majority and Minority
• Fully compressed suffix trees
• Alphabet-Independent Compressed Text Indexing
• Optimal Lower and Upper Bounds for Representing Sequences
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Lowest common ancestors in trees and directed acyclic graphs

This page was built for publication: Tree path majority data structures