Path queries in weighted trees

DOI10.1007/978-3-642-25591-5_16MaRDI QIDQ3104608zbMATH OpenOpenAlexFDO

Authors Meng He, J. Ian Munro, Gelin Zhou

Publication date 16 December 2011

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10012/6883

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Data structures for path queries
• Succinct representations of weighted trees supporting path queries
• Succinct Data Structures for Path Queries
• Dynamic path queries in linear space
• Path minima queries in dynamic weighted trees

Cited in

(14)

• 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
• Array range queries
• Dynamic path counting and reporting in linear space
• Forward node-selecting queries over trees
• A framework for succinct labeled ordinal trees over large alphabets
• Data structures for path queries
• Tree path majority data structures
• Path minima queries in dynamic weighted trees
• Data structures for categorical path counting queries
• Weighted hypertree decompositions and optimal query plans

This page was built for publication: Path queries in weighted trees

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