Succinct ordinal trees based on tree covering

DOI10.1145/2344422.2344432zbMath1295.68102OpenAlexW2153294698MaRDI QIDQ3189085

J. Ian Munro, Meng He, Srinivasa Rao Satti

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2344422.2344432

zbMATH Keywords

succinct data structuresordinal treestree covering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05)

Related Items (13)

Succinct indices for path minimum, with applications ⋮ Simultaneous encodings for range and next/previous larger/smaller value queries ⋮ Representation of ordered trees with a given degree distribution ⋮ Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits ⋮ The function-inversion problem: barriers and opportunities ⋮ Parallel construction of succinct trees ⋮ Succinct data structure for dynamic trees with faster queries ⋮ Unnamed Item ⋮ A framework for succinct labeled ordinal trees over large alphabets ⋮ Path queries on functions ⋮ Dynamic path queries in linear space ⋮ Succinct Representations of Ordinal Trees ⋮ Data structures for categorical path counting queries

This page was built for publication: Succinct ordinal trees based on tree covering