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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beineke, L.W., Pippert, R.E.: On the Number of k-Dimensional Trees. Journal of Combinatorial Theory 6, 200–205 (1969)
Bodlaender, H.L.: A Tourist Guide Through Treewidth. Acta Cybernetica 11, 1–21 (1993)
Bodlaender, H.L.: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theoretical Computer Science 209, 1–45 (1998)
Caminiti, S., Finocchi, I., Petreschi, R.: A Unified Approach to Coding Labeled Trees. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 339–348. Springer, Heidelberg (2004)
Caminiti, S., Petreschi, R.: String Coding of Trees with Locality and Heritability. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 251–262. Springer, Heidelberg (2005)
Cayley, A.: A Theorem on Trees. Quarterly Journal of Mathematics 23, 376–378 (1889)
Chen, W.Y.C.: A general bijective algorithm for trees. In: Proceedings of the National Academy of Science, vol. 87, pp. 9635–9639 (1990)
Chen, W.Y.C.: A Coding Algorithm for Rényi Trees. Journal of Combinatorial Theory 63A, 11–25 (1993)
Deo, N., Micikevičius, P.: A New Encoding for Labeled Trees Employing a Stack and a Queue. Bulletin of the Institute of Combinatorics and its Applications (ICA) 34, 77–85 (2002)
Eğecioğlu, Ö., Remmel, J.B.: Bijections for Cayley Trees, Spanning Trees, and Their q-Analogues. Journal of Combinatorial Theory 42A(1), 15–30 (1986)
Eğecioğlu, Ö., Shen, L.P.: A Bijective Proof for the Number of Labeled q-Trees. Ars Combinatoria 25B, 3–30 (1988)
Foata, D.: Enumerating k-Trees. Discrete Mathematics 1(2), 181–186 (1971)
Greene, C., Iba, G.A.: Cayley’s Formula for Multidimensional Trees. Discrete Mathematics 13, 1–11 (1975)
Harary, F., Palmer, E.M.: On Acyclic Simplicial Complexes. Mathematika 15, 115–122 (1968)
Markenzon, L., Costa Pereira, P.R., Vernet, O.: The Reduced Prüfer Code for Rooted Labelled k-Trees. In: Proceedings of 7th International Colloquium on Graph Theory. Electronic Notes in Discrete Mathematics, vol. 22, pp. 135–139 (2005)
Moon, J.W.: The Number of Labeled k −Trees. Journal of Combinatorial Theory 6, 196–199 (1969)
Moon, J.W.: Counting Labeled Trees. William Clowes and Sons, London (1970)
Neville, E.H.: The Codifying of Tree-Structure. In: Proceedings of Cambridge Philosophical Society, vol. 49, pp. 381–385 (1953)
Picciotto, S.: How to Encode a Tree. PhD thesis, University of California, San Diego (1999)
Prüfer, H.: Neuer Beweis eines Satzes über Permutationen. Archiv der Mathematik und Physik 27, 142–144 (1918)
Rényi, A., Rényi, C.: The Prüfer Code for k-Trees. In: Erdös, P., et al. (eds.) Combinatorial Theory and its Applications, pp. 945–971. North-Holland, Amsterdam (1970)
Rose, D.J.: On Simple Characterizations of k-Trees. Discrete Mathematics 7, 317–322 (1974)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caminiti, S., Fusco, E.G., Petreschi, R. (2007). A Bijective Code for k-Trees with Linear Time Encoding and Decoding. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)