The coding of binary trees

MaRDI QIDQ1388063zbMATH OpenFDO

Authors Vincent Vajnovszki

Publication date 8 June 1998

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

zbMATH Keywords

binary trees

Mathematics Subject Classification ID

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

Review text

On a présenté plusieurs méthodes pour représenter la structure d'un arbre, sans privilégier une certaine méthode pour une application spécifique. Généralement un critère de sélection n'existe pas. Certains codages exprime mieux que d'autres certaines propriétés des arbres et le choix du codage peut être essentielle.

Recommendations

• scientific article; zbMATH DE number 58304
• scientific article; zbMATH DE number 1852837
• Generation of binary trees from (0-1) codes
• scientific article; zbMATH DE number 743588

Cited in

(13)

• Encoding trees by linear recurrence sequences
• Non-malleable codes for decision trees
• On coding labeled trees
• scientific article; zbMATH DE number 1696804 (Why is no real title available?)
• Binary Tree Code Words as Context-Free Languages
• Generating binary trees in A-order from codewords defined on a four-letter alphabet
• scientific article; zbMATH DE number 1472176 (Why is no real title available?)
• scientific article; zbMATH DE number 1759379 (Why is no real title available?)
• A New Coding Algorithm for Trees
• scientific article; zbMATH DE number 2147927 (Why is no real title available?)
• scientific article; zbMATH DE number 1852837 (Why is no real title available?)
• Is Prüfer code encoding always a bad idea?
• An improvement of the tree code construction

This page was built for publication: The coding of binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388063)