On embedding subclasses of height-balanced trees in hypercubes-Reference-Cited by-同舟云学术

On embedding subclasses of height-balanced trees in hypercubes

Published:2009-04 Issue:9 Volume:179 Page:1333-1347
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Choudum S.A.,Indhumathi R.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference25 articles.

1. An algorithm for the organization of information;Adelson-Velskii;Soviet Mathematics Doklady,1962

2. General balance trees;Andersson;Journal of Algorithms,1999

3. Solving efficiently the 0–1 multi-objective knapsack problem;Bazgan;Computers & Operations Research,2009

4. S.N. Bhatt, I.C. Ipsen, How to Embed Trees in Hypercubes, Technical Report YALEU/DCS/RR-443, Yale University, 1985.

5. S.A. Choudum, R. Indhumathi, Embedding height balanced trees and Fibonacci trees in hypercubes, Journal of Applied Mathematics & Computing, accepted for publication.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees;Fundamenta Informaticae;2023-06-19

2. Certain height-balanced subtrees of hypercubes;International Journal of Computer Mathematics: Computer Systems Theory;2016-01-02

3. Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees;Discrete Optimization;2015-08

4. Embedding certain height-balanced trees and completepm-ary trees into hypercubes;Journal of Discrete Algorithms;2013-09

5. An optimal time algorithm for minimum linear arrangement of chord graphs;Information Sciences;2013-07