A bijective code for k-trees with linear time encoding and decoding

  • Authors:

  • Saverio Caminiti;Emanuele G. Fusco;Rossella Petreschi

  • Affiliations:

  • Computer Science Department, University of Rome "La Sapienza", Rome, Italy;Computer Science Department, University of Rome "La Sapienza", Rome, Italy;Computer Science Department, University of Rome "La Sapienza", Rome, Italy

  • Venue:
  • ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of coding labeled trees has been widely studied in the literature and several bijective codes that realize associations between labeled trees and sequences of labels have been presented. k-trees are one of the most natural and interesting generalizations of trees and there is considerable interest in developing efficient tools to manipulate this class, since many NP-Complete problems have been shown to be polynomially solvable on k-trees and partial k-trees. In 1970 Rényi and Rényi generalized the Prüfer code to a subset of labeled k-trees; subsequently, non redundant codes that realize bijection between k-trees (or Rényi k-trees) and a well defined set of strings were produced. In this paper we introduce a new bijective code for labeled k-trees which, to the best of our knowledge, produces the first encoding and decoding algorithms running in linear time with respect to the size of the k-tree.