Table of Contents Author Guidelines Submit a Manuscript
Modelling and Simulation in Engineering
Volume 2014, Article ID 748941, 5 pages
Research Article

On Counting and Embedding a Subclass of Height-Balanced Trees

School of Information Technology and Engineering, VIT University, Vellore 632014, India

Received 7 February 2014; Revised 5 May 2014; Accepted 5 May 2014; Published 26 May 2014

Academic Editor: Aiguo Song

Copyright © 2014 Indhumathi Raman. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, Calif, USA, 1992.
  2. G. M. Adelson-Velskii and E. M. Landis, “An algorithm for the organization of information,” Soviet Mathematics Doklady, vol. 3, pp. 1259–1262, 1962. View at Google Scholar
  3. P. Crescnzi and A. Piperno, “Optimal-area drawings of AVL trees,” in Proceedings of the DIMACS International Workshop on Graph Drawings, vol. 894 of Lecture Notes in Computer Science, pp. 307–317, 1994.
  4. C. S. Ellis, “Concurrent search and insertion in AVL trees,” IEEE Transactions on Computers, vol. 29, no. 9, pp. 811–817, 1980. View at Google Scholar · View at Scopus
  5. M. Medidi and N. Deo, “Parallel dictionaries using AVL trees,” Journal of Parallel and Distributed Computing, vol. 49, no. 1, pp. 146–155, 1998. View at Publisher · View at Google Scholar · View at Scopus
  6. C. C. Foster, “Information storage and retrieval using AVL trees,” in Proceedings of the ACM 20th National Conference, pp. 192–205, 1965.
  7. P. L. Karlton, S. H. Fuller, R. E. Scroggs, and E. B. Kaehler, “Performance of height-balanced trees,” Communications of the ACM, vol. 19, no. 1, pp. 23–28, 1976. View at Publisher · View at Google Scholar · View at Scopus
  8. S. N. Bhatt, F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg, “Efficient embeddings of trees in hypercubes,” SIAM Journal on Computing, vol. 21, no. 1, pp. 161–162, 1992. View at Google Scholar · View at Scopus
  9. S. A. Choudum and S. Lavanya, “Embedding a subclass of trees into hypercubes,” Discrete Mathematics, vol. 311, no. 10-11, pp. 866–871, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. I. Havel, “On Hamiltonian circuits and spanning trees of hypercubes,” Časopis pro Pěstování Matematiky, vol. 109, no. 2, pp. 135–152, 1984. View at Google Scholar
  11. S. A. Choudum and I. Raman, “Embedding height balanced trees and Fibonacci trees in hypercubes,” Journal of Applied Mathematics and Computing, vol. 30, no. 1-2, pp. 39–52, 2009. View at Publisher · View at Google Scholar · View at Scopus
  12. L. Nebeský, “On cubes and dichotomic trees,” Časopis pro Pěstováni Matematiky, vol. 99, pp. 164–167, 1974. View at Google Scholar