A compact encoding of unordered binary trees
From MaRDI portal
Recommendations
Cites work
Cited in
(11)- Register Allocation for Unary–Binary Trees
- Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
- Coding Binary Trees by Words over an Alphabet with Four Letters
- A uniform paradigm to succinctly encode various families of trees
- Encoding trees by linear recurrence sequences
- scientific article; zbMATH DE number 2089399 (Why is no real title available?)
- Lossless Compression of Binary Trees With Correlated Vertex Names
- Bounding the number of reduced trees, cographs, and series-parallel graphs by compression
- Entropy and optimal compression of some general plane trees
- On binary tree encodements
- Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
This page was built for publication: A compact encoding of unordered binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010392)