A Uniform Approach Towards Succinct Representation of Trees

DOI10.1007/978-3-540-69903-3_17MaRDI QIDQ3512457zbMATH OpenOpenAlexWikidataFDO

Authors Arash Farzan, J. Ian Munro

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

Data structures (68P05)

Recommendations

• A uniform paradigm to succinctly encode various families of trees
• On succinct representations of binary trees
• Ultra-succinct representation of ordered trees with applications
• Ultra-succinct representation of ordered trees
• Succinct representation of labeled trees
• Succinct representations of ordinal trees
• Succinct representation of dynamic trees
• An Improved Succinct Representation for Dynamic k-ary Trees
• Universal Succinct Representations of Trees?

Cites work

• Binary trees having a given number of nodes with 0, 1, and 2 children
• Catalan, Motzkin, and Riordan numbers
• scientific article; zbMATH DE number 3865301 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Non-Associate Powers and a Functional Equation
• Representing dynamic binary trees succinctly
• Representing trees of higher degree
• Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
• Succinct indexes for strings, binary relations and multi-labeled trees
• Succinct Ordinal Trees Based on Tree Covering
• Succinct ordinal trees with level-ancestor queries
• The number of trees
• Ultra-succinct representation of ordered trees

Cited in

(13)

• 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
• Ultra-succinct representation of ordered trees with applications
• Compact navigation and distance oracles for graphs with small treewidth
• Succinct representation of labeled trees
• Efficient Schemes for Computing α-tree Representations
• Shortcutting directed and undirected networks with a degree constraint
• Succinct Trees in Practice
• Combined data structure for previous- and next-smaller-values
• Succinct representation of dynamic trees

This page was built for publication: A Uniform Approach Towards Succinct Representation of Trees

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