Succinct Ordinal Trees Based on Tree Covering

DOI10.1007/978-3-540-73420-8_45MaRDI QIDQ5428835zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Succinct ordinal trees based on tree covering
• Succinct representations of ordinal trees
• Universal Succinct Representations of Trees?
• Fully-functional succinct trees
• Balanced parentheses strike back

Cited in

(27)

• Succinct representation of labeled graphs
• Succinct and I/O efficient data structures for traversal in trees
• A uniform paradigm to succinctly encode various families of trees
• Representation of ordered trees with a given degree distribution
• Fully functional static and dynamic succinct trees
• Succinct representations of ordinal trees
• Ultra-succinct representation of ordered trees
• Succinct ordinal trees with level-ancestor queries
• Compact navigation and distance oracles for graphs with small treewidth
• Succinct ordinal trees based on tree covering
• A Uniform Approach Towards Succinct Representation of Trees
• Succinct and I/O Efficient Data Structures for Traversal in Trees
• Universal Succinct Representations of Trees?
• Succinct representations of trees
• Ultra-succinct representation of ordered trees with applications
• Succinct representations of permutations and functions
• Compact navigation and distance oracles for graphs with small treewidth
• A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
• Balanced parentheses strike back
• Engineering the LOUDS Succinct Tree Representation
• Combined data structure for previous- and next-smaller-values
• Succinct representation of dynamic trees
• Fully-functional succinct trees
• Succinct ordinal trees with level-ancestor queries
• Enumeration and succinct encoding of AVL trees
• Succinct encodings of binary trees with application to AVL trees
• Faster path queries in colored trees via sparse matrix multiplication and min-plus product

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

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