A Uniform Approach Towards Succinct Representation of Trees

DOI10.1007/978-3-540-69903-3_17zbMath1155.68373WikidataQ56032216 ScholiaQ56032216MaRDI QIDQ3512457

J. Ian Munro, Arash Farzan

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_17

Mathematics Subject Classification ID

68P05: Data structures

Related Items

Ultra-succinct representation of ordered trees with applications, Compact navigation and distance oracles for graphs with small treewidth, Succinct representation of labeled trees, Shortcutting directed and undirected networks with a degree constraint, Combined data structure for previous- and next-smaller-values, Succinct representation of dynamic trees, Encoding 2D range maximum queries, On succinct representations of binary trees, A uniform paradigm to succinctly encode various families of trees, GLOUDS: representing tree-like graphs, Fully Functional Static and Dynamic Succinct Trees, Succinct Representations of Ordinal Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing trees of higher degree
• Catalan, Motzkin, and Riordan numbers
• Binary trees having a given number of nodes with 0, 1, and 2 children
• The number of trees
• Succinct ordinal trees with level-ancestor queries
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Succinct Ordinal Trees Based on Tree Covering
• Non-Associate Powers and a Functional Equation