Linear time tree codes

DOI10.1007/BF02242268zbMath0547.68065OpenAlexW43233584MaRDI QIDQ799118

H. Schreck, Gottfried Tinhofer

Publication date: 1984

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242268

zbMATH Keywords

algorithmcoding unlabeled trees into strings of integersgeneration of treestree codes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Uniform random generation of expressions respecting algebraic identities ⋮ Computing the characteristic polynomial of a tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new algorithm for solving the tree isomorphism problem
• Lexicographic generation of ordered trees
• The distribution of degrees in a large random tree
• Constant Time Generation of Rooted Trees
• The distance matrix of a graph and its tree realization
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Diagonal tree codes
• Generating Trees and Other Combinatorial Objects Lexicographically
• An Optimal Diagonal Tree Code
• A method for the linear recording of graphs