Data structures for path queries

DOI10.1145/2905368MaRDI QIDQ4962630zbMATH OpenOpenAlexFDO

Authors Meng He, J. Ian Munro, Gelin Zhou

Publication date 5 November 2018

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

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

zbMATH Keywords

succinct data structurespath countingtree extractionpath queriespath selectionpath reportingpath median

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Succinct Data Structures for Path Queries
• Path queries in weighted trees
• Succinct representations of weighted trees supporting path queries
• Succinct indices for path minimum, with applications to path reporting
• Dynamic path queries in linear space

Cited in

(17)

• Faster path queries in colored trees via sparse matrix multiplication and min-plus product
• Succinct indices for path minimum, with applications
• Path queries on functions
• Succinct indices for path minimum, with applications to path reporting
• Path queries in weighted trees
• Data structures for categorical path counting queries
• Data structures for categorical path counting queries
• Succinct representations of weighted trees supporting path queries
• Dynamic path queries in linear space
• Dynamic path counting and reporting in linear space
• Range selection and predecessor queries in data aware space and time
• Succinct Data Structures for Path Queries
• Top tree compression of tries
• Tree path majority data structures
• Path and ancestor queries over trees with multidimensional weight vectors
• Path queries on functions
• On approximate colored path counting

This page was built for publication: Data structures for path queries

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