Path Queries in Weighted Trees

DOI10.1007/978-3-642-25591-5_16zbMath1350.68073OpenAlexW76906293MaRDI QIDQ3104608

Gelin Zhou, J. Ian Munro, Meng He

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)

Related Items (6)

Succinct indices for path minimum, with applications ⋮ Succinct representations of weighted trees supporting path queries ⋮ A framework for succinct labeled ordinal trees over large alphabets ⋮ Dynamic path queries in linear space ⋮ Array Range Queries ⋮ Linear-space data structures for range frequency queries on arrays and trees

This page was built for publication: Path Queries in Weighted Trees