Succinct and I/O Efficient Data Structures for Traversal in Trees

DOI10.1007/978-3-540-92182-0_13zbMath1183.68211OpenAlexW1587123803MaRDI QIDQ3596711

Meng He, Craig Dillabaugh, Anil Maheshwari

Publication date: 29 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_13

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (2)

Succinct and I/O efficient data structures for traversal in trees ⋮ I/O-efficient path traversal in succinct planar graphs

This page was built for publication: Succinct and I/O Efficient Data Structures for Traversal in Trees