Bijective linear time coding and decoding for \(k\)-trees
type: Item
instance of: scholarly article
title: Bijective linear time coding and decoding for \(k\)-trees
zbMATH Open document ID: 1209.68356
author: Saverio Caminiti
author: Emanuele G. Fusco
author: Rossella Petreschi
published in: Theory of Computing Systems
publication date: 2010-05-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5706003
zbMATH Keywords: labeled \(k\)-tree
zbMATH Keywords: Rényi \(k\)-trees
zbMATH Keywords: combinatorial codes
zbMATH Keywords: linear time algorithms
MaRDI profile type: Publication
full work available at URL: s00224-008-9131-0
OpenAlex ID: W2127599473
Wikidata QID: Q114230790
cites work: The number of labeled k-dimensional trees
cites work: Q4291429
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: LATIN 2004: Theoretical Informatics
cites work: On coding labeled trees
cites work: A Bijective Code for k-Trees with Linear Time Encoding and Decoding
cites work: Computing and Combinatorics
cites work: A general bijective algorithm for trees.
cites work: A coding algorithm for Rényi trees
cites work: Jewels of Stringology
cites work: Q4489194
cites work: Q4529501
cites work: Constrained minimal spanning trees solved by a GA with feasible encodings
cites work: Bijections for Cayley trees, spanning trees, and their q-analogues
cites work: Enumerating k-trees
cites work: Cayley's formula for multidimensional trees
cites work: On acyclic simplicial complexes
cites work: The Reduced Prüfer Code for Rooted Labelled k-Trees
cites work: The number of labeled k-trees
cites work: Q5616724
cites work: Q5818007
cites work: Q5607734
cites work: On simple characterizations of k-trees
cites work: Q4000296
DOI: 10.1007/S00224-008-9131-0
Recommended article: A Bijective Code for k-Trees with Linear Time Encoding and Decoding
Recommended article: On binary tree encodements
Recommended article: Linear time tree codes
Recommended article: Linear tree codes and the problem of explicit constructions
Recommended article: Q3429473
Recommended article: Tree approximation and optimal encoding
Recommended article: OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
Recommended article: Bit-optimal decoding of codes whose Tanner graphs are trees
Recommended article: Encoding trees by linear recurrence sequences
Recommended article: Towards deterministic tree code constructions
description: scientific article; zbMATH DE number 5706003