A Bijective Code for k-Trees with Linear Time Encoding and Decoding

DOI10.1007/978-3-540-74450-4_37MaRDI QIDQ3611931zbMATH OpenOpenAlexFDO

Authors Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi

Publication date 3 March 2009

Published in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74450-4_37

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Bijective linear time coding and decoding for \(k\)-trees
• A coding algorithm for Rényi trees
• An efficient algorithm for generating Prüfer codes from labelled trees
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• LATIN 2004: Theoretical Informatics

Cited in

(8)

• Linear-time algorithms for encoding trees as sequences of node labels
• Bijective linear time coding and decoding for \(k\)-trees
• Parallel algorithms for encoding and decoding Blob code
• Evolutionary design of oriented-tree networks using Cayley-type encodings
• A coding algorithm for Rényi trees
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Efficient Prüfer-like coding and counting labelled hypertrees

This page was built for publication: A Bijective Code for k-Trees with Linear Time Encoding and Decoding

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