Linear time tree codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3679848 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3575612 (Why is no real title available?)
- scientific article; zbMATH DE number 3307338 (Why is no real title available?)
- scientific article; zbMATH DE number 3390780 (Why is no real title available?)
- A method for the linear recording of graphs
- A new algorithm for solving the tree isomorphism problem
- An Optimal Diagonal Tree Code
- Constant Time Generation of Rooted Trees
- Diagonal tree codes
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Generating Trees and Other Combinatorial Objects Lexicographically
- Lexicographic generation of ordered trees
- The distance matrix of a graph and its tree realization
- The distribution of degrees in a large random tree
Cited in
(11)- Linear-time algorithms for encoding trees as sequences of node labels
- scientific article; zbMATH DE number 743588 (Why is no real title available?)
- scientific article; zbMATH DE number 1744078 (Why is no real title available?)
- Encoding trees by linear recurrence sequences
- On the reconstruction of a Motzkin Tree from its code
- Data coding by linear forms of numerical sequences
- Computing and Combinatorics
- Computing the characteristic polynomial of a tree
- A note on trees and codes
- Bijective linear time coding and decoding for \(k\)-trees
- Uniform random generation of expressions respecting algebraic identities
This page was built for publication: Linear time tree codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799118)