Linear-time algorithms for encoding trees as sequences of node labels

MaRDI QIDQ3429473zbMATH OpenFDO

Authors Paulius Micikevicius, Saverio Caminiti, Narsingh Deo

Publication date 2 April 2007

zbMATH Keywords

labeled treePicciotto's codes

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• On coding labeled trees
• LATIN 2004: Theoretical Informatics
• Linear time tree codes
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• scientific article; zbMATH DE number 1735659

Cited in

(10)

• Bijective linear time coding and decoding for \(k\)-trees
• scientific article; zbMATH DE number 1149447 (Why is no real title available?)
• Encoding trees by linear recurrence sequences
• On coding labeled trees
• scientific article; zbMATH DE number 2089399 (Why is no real title available?)
• Is Prüfer code encoding always a bad idea?
• Linear-time algorithm for sliding tokens on trees
• Linear time tree codes
• scientific article; zbMATH DE number 1744078 (Why is no real title available?)
• Unified parallel encoding and decoding algorithms for Dandelion-like codes

This page was built for publication: Linear-time algorithms for encoding trees as sequences of node labels

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