Succinct Ordinal Trees Based on Tree Covering

DOI10.1007/978-3-540-73420-8_45zbMath1171.68436OpenAlexW2123578659MaRDI QIDQ5428835

Meng He, J. Ian Munro, S. Srinivasa Rao

Publication date: 28 November 2007

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73420-8_45

Mathematics Subject Classification ID

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

Related Items (9)

Succinct representation of labeled graphs ⋮ A Uniform Approach Towards Succinct Representation of Trees ⋮ Succinct representations of permutations and functions ⋮ A uniform paradigm to succinctly encode various families of trees ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Compact Navigation and Distance Oracles for Graphs with Small Treewidth ⋮ Combined data structure for previous- and next-smaller-values ⋮ Succinct representation of dynamic trees ⋮ Fully Functional Static and Dynamic Succinct Trees

This page was built for publication: Succinct Ordinal Trees Based on Tree Covering