Succinct Data Structures for Path Queries

DOI10.1007/978-3-642-33090-2_50MaRDI QIDQ2912875zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Data structures for path queries
• Data structures for categorical path counting queries
• Data structures for categorical path counting queries
• Succinct data structure for dynamic trees with faster queries
• Succinct representations of weighted trees supporting path queries
• A practical succinct data structure for tree-like graphs
• Succinct and I/O Efficient Data Structures for Traversal in Trees
• Succinct and I/O efficient data structures for traversal in trees
• scientific article; zbMATH DE number 5808834

Cited in

(17)

• Succinct data structures for nearest colored node in a tree
• Path queries on functions
• Dynamic path queries in linear space
• Data structures for categorical path counting queries
• Succinct indices for path minimum, with applications
• Succinct representations of weighted trees supporting path queries
• Linear-space data structures for range frequency queries on arrays and trees
• Succinct and Implicit Data Structures for Computational Geometry
• Array range queries
• Succinct indices for path minimum, with applications to path reporting
• Path queries in weighted trees
• A framework for succinct labeled ordinal trees over large alphabets
• Data structures for path queries
• Tree path majority data structures
• Write it recursively
• Data structures for categorical path counting queries
• Tree path majority data structures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912875)