A Compact Encoding of Unordered Binary Trees

DOI10.1007/978-3-642-20877-5_11zbMath1331.68061OpenAlexW153149523WikidataQ60691839 ScholiaQ60691839MaRDI QIDQ3010392

Shiro Ishiwata, Kozue Iwata, Shin-ichi Nakano

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_11

zbMATH Keywords

treescodingcompact representation

Mathematics Subject Classification ID

Trees (05C05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Efficient graph representations
• Efficient generation of plane trees.
• Succinct Representation of Balanced Parentheses and Static Trees
• Succinct ordinal trees with level-ancestor queries

This page was built for publication: A Compact Encoding of Unordered Binary Trees