An efficient algorithm for generating Prüfer codes from labelled trees

DOI10.1007/S002249910006MaRDI QIDQ1969439zbMATH OpenOpenAlexFDO

Authors Yanyan Li, Hon-Chan Chen, Yue-Li Wang

Publication date 16 March 2000

Published in Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

labeled treesPrüfer code

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Computing Prüfer codes efficiently in parallel
• scientific article; zbMATH DE number 1472143
• scientific article; zbMATH DE number 1507236
• LATIN 2004: Theoretical Informatics
• scientific article; zbMATH DE number 1735659

Cited in

(15)

• Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm
• On the locality of the Prüfer code
• Efficient Prüfer-like coding and counting labelled hypertrees
• Network generation using the Prufer code
• Computing Prüfer codes efficiently in parallel
• From words to graphs, and back
• On coding labeled trees
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• Generating binary trees in A-order from codewords defined on a four-letter alphabet
• scientific article; zbMATH DE number 1735659 (Why is no real title available?)
• scientific article; zbMATH DE number 1472143 (Why is no real title available?)
• scientific article; zbMATH DE number 1507236 (Why is no real title available?)
• Efficient Prüfer-Like Coding and Counting Labelled Hypertrees
• Ranking and unranking of the planar embeddings of a planar graph

This page was built for publication: An efficient algorithm for generating Prüfer codes from labelled trees

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