Abstract
An algorithm is presented for generating trees in A-order using z-sequences series. This algorithm generates both k-ary and (k,m)-ary trees and it is the first algorithm which generates these trees independently from their structures. This algorithm has implemented in java with two classes completely and works successfully. I have used an array to store all information which are necessary about nodes. Both space and time complexities of this algorithm are optimal.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahrabian, H., Nowzari-Dalini, A.: Parallel generation of trees in A-order. Parallel Computing 31, 955–984 (2005)
Ahrabian, H., Nowzari-Dalini, A.: Gray code algorithm for listing k-ary trees. Studies in Informatics and Control 13, 243–251 (2004)
Zaks, S.: Lexicographic generation of ordered tree. Theor. Comput. Sci. 10, 63–82 (1980)
Rosena, R., Du, x., Liu, F. (k,m)-Catalan numbers and hook length polynomials for plane trees, January 24, pp. 1312–1321 (2007)
Ahrabian, H., Nowzari-Dalini, A.: On the generation of the P-sequences. Adv. Modeling Optim. 5, 27–38 (2003)
Er, M.C.: Efficient generation of k-ary trees in natural order. Comput. J. 35, 306–308 (1992)
Korsh, J.F.: A-order generation of k-ary trees with 4k-4 letter alphabet. J. Inform Optim. Sci. 16, 557–567 (1995)
Pallo, J.: Generating trees with n nodes and m leaves. Intern J. Comput. Math. 21, 133–144 (1987)
Vajnovszki, V., Philips, C.: Optimal algorithm for generating k-ary trees. In: Woodfill, M.C. (ed.) Proc. 12th International conference on computer and applications, pp. 201–204. ISCA, Raleight (1997)
Ahrabian, H., Nowzari-Dalini, A.: Parallel generation of trees in A-order. The Computer Journal (2007)
Aigner, M.: Enumeration via ballot numbers. Discrete Mathematics (2008)
Bergeron, N., Descounens, F., Zabrockia, M.: A filtration of (q,t)-catalan numbers. Advances in Applied Mathematics 44, 16–36 (2010)
Huglund, J.: Conjectured statistics for the q; t-Catalan numbers. Advances in Mathematics 175, 319–334 (2003)
Zaks, S.: Lexicographic generation of ordered tree. Theor. Comput. Sci. 10, 63–82 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Payaman, N.A.A. (2010). Generation of k-ary and (k,m)-ary Trees in A-order Using z-Sequences. In: Das, V.V., Vijaykumar, R. (eds) Information and Communication Technologies. ICT 2010. Communications in Computer and Information Science, vol 101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15766-0_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-15766-0_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15765-3
Online ISBN: 978-3-642-15766-0
eBook Packages: Computer ScienceComputer Science (R0)