Succinct Data Structures for Path Queries

DOI10.1007/978-3-642-33090-2_50zbMath1365.68181OpenAlexW1505556920MaRDI QIDQ2912875

Meng He, J. Ian Munro, Gelin Zhou

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33090-2_50

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (7)

Succinct indices for path minimum, with applications ⋮ A framework for succinct labeled ordinal trees over large alphabets ⋮ Path queries on functions ⋮ Dynamic path queries in linear space ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Array Range Queries ⋮ Linear-space data structures for range frequency queries on arrays and trees

This page was built for publication: Succinct Data Structures for Path Queries