Encoding trees by linear recurrence sequences
From MaRDI portal
Recommendations
- Linear-time algorithms for encoding trees as sequences of node labels
- On binary tree encodements
- The coding of binary trees
- A coding algorithm for Rényi trees
- Tree approximation and optimal encoding
- On encodings of spanning trees
- A New Coding Algorithm for Trees
- Linear time tree codes
- A compact encoding of unordered binary trees
- Linear recurrences originating from polynomial trees
Cites work
- scientific article; zbMATH DE number 177816 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1735659 (Why is no real title available?)
- scientific article; zbMATH DE number 1744078 (Why is no real title available?)
- scientific article; zbMATH DE number 3079148 (Why is no real title available?)
- Binary tree gray codes
- Enumerating Ordered Trees Lexicographically
- Fibonacci linear forms and parallel arithmetic algorithms for large numbers
- Generating Binary Trees Lexicographically
- Lexicographic generation of ordered trees
- On a 1-1-correspondence between rooted trees and natural numbers
- On an algorithm of Zemlyachenko for subtree isomorphism
- On finding common subtrees
- Prefix Encoding by Means of the $(2,3)$-Representation of Numbers
- TREE COMPRESSION AND OPTIMIZATION WITH APPLICATIONS
- Tree compression with top trees
- Two-base numeration systems
- Variations on the Common Subexpression Problem
Cited in
(3)
This page was built for publication: Encoding trees by linear recurrence sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699391)
