Skip to main content
SpringerLink
Log in
Book cover

International Conference on Advances in Information and Communication Technologies

ICT 2010: Information and Communication Technologies pp 330–335Cite as

Generation of k-ary and (k,m)-ary Trees in A-order Using z-Sequences

  • Conference paper

  • 1256 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 101))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahrabian, H., Nowzari-Dalini, A.: Parallel generation of trees in A-order. Parallel Computing 31, 955–984 (2005)

    Article  MathSciNet  Google Scholar 

  2. Ahrabian, H., Nowzari-Dalini, A.: Gray code algorithm for listing k-ary trees. Studies in Informatics and Control 13, 243–251 (2004)

    Google Scholar 

  3. Zaks, S.: Lexicographic generation of ordered tree. Theor. Comput. Sci. 10, 63–82 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  4. Rosena, R., Du, x., Liu, F. (k,m)-Catalan numbers and hook length polynomials for plane trees, January 24, pp. 1312–1321 (2007)

    Google Scholar 

  5. Ahrabian, H., Nowzari-Dalini, A.: On the generation of the P-sequences. Adv. Modeling Optim. 5, 27–38 (2003)

    MATH  MathSciNet  Google Scholar 

  6. Er, M.C.: Efficient generation of k-ary trees in natural order. Comput. J. 35, 306–308 (1992)

    Google Scholar 

  7. Korsh, J.F.: A-order generation of k-ary trees with 4k-4 letter alphabet. J. Inform Optim. Sci. 16, 557–567 (1995)

    MATH  MathSciNet  Google Scholar 

  8. Pallo, J.: Generating trees with n nodes and m leaves. Intern J. Comput. Math. 21, 133–144 (1987)

    Article  MATH  Google Scholar 

  9. 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)

    Google Scholar 

  10. Ahrabian, H., Nowzari-Dalini, A.: Parallel generation of trees in A-order. The Computer Journal (2007)

    Google Scholar 

  11. Aigner, M.: Enumeration via ballot numbers. Discrete Mathematics (2008)

    Google Scholar 

  12. Bergeron, N., Descounens, F., Zabrockia, M.: A filtration of (q,t)-catalan numbers. Advances in Applied Mathematics 44, 16–36 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  13. Huglund, J.: Conjectured statistics for the q; t-Catalan numbers. Advances in Mathematics 175, 319–334 (2003)

    Article  MathSciNet  Google Scholar 

  14. Zaks, S.: Lexicographic generation of ordered tree. Theor. Comput. Sci. 10, 63–82 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Engineering Department of Teacher Training University, Tehran, Iran

    N. A. Ashrafi Payaman

Authors
  1. N. A. Ashrafi Payaman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineers Network, Trivandrum, Kerala, India

    Vinu V Das

  2. NSS College of Engineering, Palakkadu, India

    R. Vijaykumar

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation