Bijective linear time coding and decoding for k-trees

DOI10.1007/S00224-008-9131-0zbMATH Open1209.68356OpenAlexW2127599473WikidataQ114230790 ScholiaQ114230790MaRDI QIDQ970106FDOQ970106

Authors Saverio Caminiti, Emanuele G. Fusco, 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

linear time algorithmscombinatorial codeslabeled \(k\)-tree[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=R%EF%BF%BD%EF%BF%BDnyi+%5C%28k%5C%29-trees&go=Go R��nyi \(k\)-trees]

Mathematics Subject Classification ID

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

Recommendations

• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• On binary tree encodements
• Linear time tree codes
• Linear tree codes and the problem of explicit constructions
• Linear-time algorithms for encoding trees as sequences of node labels
• Tree approximation and optimal encoding
• OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
• Bit-optimal decoding of codes whose Tanner graphs are trees
• Encoding trees by linear recurrence sequences
• Towards deterministic tree code constructions

Cites Work

• scientific article; zbMATH DE number 50662 (Why is no real title available?)
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 1472143 (Why is no real title available?)
• scientific article; zbMATH DE number 1744078 (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?)
• scientific article; zbMATH DE number 3079148 (Why is no real title available?)
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding
• A coding algorithm for Rényi trees
• A general bijective algorithm for trees.
• A partial k-arboretum of graphs with bounded treewidth
• Bijections for Cayley trees, spanning trees, and their q-analogues
• Cayley's formula for multidimensional trees
• Computing and Combinatorics
• Constrained minimal spanning trees solved by a GA with feasible encodings
• Enumerating k-trees
• Jewels of Stringology
• LATIN 2004: Theoretical Informatics
• On acyclic simplicial complexes
• On coding labeled trees
• On simple characterizations of k-trees
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• The number of labeled k-dimensional trees
• The number of labeled k-trees

Cited In (7)

• Learning bounded tree-width Bayesian networks via sampling
• A coding algorithm for Rényi trees
• Efficient learning of Bayesian networks with bounded tree-width
• The Reduced Prüfer Code for Rooted Labelled k-Trees
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Title not available (Why is no real title available?)
• A Bijective Code for k-Trees with Linear Time Encoding and Decoding

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

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