Bijective linear time coding and decoding for \(k\)-trees

DOI10.1007/s00224-008-9131-0zbMath1209.68356OpenAlexW2127599473WikidataQ114230790 ScholiaQ114230790MaRDI QIDQ970106

Emanuele G. Fusco, Saverio Caminiti, Rossella Petreschi

Publication date: 10 May 2010

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

Full work available at URL: https://doi.org/10.1007/s00224-008-9131-0

zbMATH Keywords

combinatorial codeslinear time algorithmslabeled \(k\)-treeRényi \(k\)-trees

Mathematics Subject Classification ID

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

Related Items (2)

Efficient learning of Bayesian networks with bounded tree-width ⋮ Learning Bounded Tree-Width Bayesian Networks via Sampling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bijections for Cayley trees, spanning trees, and their q-analogues
• A coding algorithm for Rényi trees
• Cayley's formula for multidimensional trees
• A partial k-arboretum of graphs with bounded treewidth
• On simple characterizations of k-trees
• On coding labeled trees
• Enumerating k-trees
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• A general bijective algorithm for trees.
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• Jewels of Stringology
• On acyclic simplicial complexes
• The number of labeled k-dimensional trees
• The number of labeled k-trees
• Computing and Combinatorics
• LATIN 2004: Theoretical Informatics

This page was built for publication: Bijective linear time coding and decoding for \(k\)-trees