A coding algorithm for Rényi trees

DOI10.1016/0097-3165(93)90021-YMaRDI QIDQ1207762zbMATH OpenFDO

Authors William Y. C. Chen

Publication date 23 May 1993

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

sequences\(k\)-treesbijectionRényi trees

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Bijective linear time coding and decoding for \(k\)-trees
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• A New Coding Algorithm for Trees
• A general bijective algorithm for trees.

Cites work

• scientific article; zbMATH DE number 4070934 (Why is no real title available?)
• scientific article; zbMATH DE number 3783051 (Why is no real title available?)
• scientific article; zbMATH DE number 3315024 (Why is no real title available?)
• scientific article; zbMATH DE number 3321029 (Why is no real title available?)
• scientific article; zbMATH DE number 3329638 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• A general bijective algorithm for trees.
• Cayley's formula for multidimensional trees
• Enumerating k-trees
• On acyclic simplicial complexes
• On simple characterizations of k-trees
• On the number of labeled 2-trees
• Onq-trees
• The number of labeled k-dimensional trees
• The number of labeled k-trees

Cited in

(17)

• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• Bijective linear time coding and decoding for \(k\)-trees
• An improvement of the tree code construction
• scientific article; zbMATH DE number 2186889 (Why is no real title available?)
• Encoding trees by linear recurrence sequences
• Non-malleable codes for decision trees
• Enumeration of labelled \((k,m)\)-trees
• Enumerating k-way trees
• Colored Prüfer codes for k-edge colored trees
• scientific article; zbMATH DE number 1472176 (Why is no real title available?)
• Counting and enumerating unlabeled split-indifference graphs
• A statistic related to trees and words on a finite alphabet
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• A general bijective algorithm for trees.
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Tree-Based Encoding for Cancellations on Morse Complexes
• A New Coding Algorithm for Trees

This page was built for publication: A coding algorithm for Rényi trees

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