TL;DR
The paper introduces a compact data structure for unlabelled rooted trees that uses only 2n bits, optimizing space efficiency for tree representations.
Contribution
It presents a novel string-based data structure for unlabelled rooted trees that significantly reduces space compared to previous methods.
Findings
Uses only 2n bits for tree representation
Efficient encoding of unlabelled rooted trees
Potential applications in compact data storage
Abstract
A string-like compact data structure for unlabelled rooted trees is given using 2n bits.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Data Mining Algorithms and Applications · Advanced Database Systems and Queries