Author:
Choudum S. A.,Raman Indhumathi
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics
Reference24 articles.
1. Adelson-Velskii, G.M., Landism, E.M.: An algorithm for the organization of information. Sov. Math. Dokl. 3, 1259–1262 (1962)
2. Andersson, A.: General balance trees. J. Algorithms 30, 1–18 (1999)
3. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London (1976)
4. Lecture Notes in Computer Science;P. Crescnzi,1994
5. Das, S.K., Min, K.B.: A unified approach to parallel construction of search trees. J. Parallel Distrib. Comput. 27, 71–78 (1995)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Balanced Clustering with a Tree over Clusters;Journal of Communications Technology and Electronics;2021-12
2. EVOLUTIONARY HIERARCHICAL CREDIBILITY;ASTIN Bulletin;2017-11-02
3. Minimum Layout of Circulant Graphs into Certain Height Balanced Trees;Theoretical Computer Science and Discrete Mathematics;2017
4. Certain height-balanced subtrees of hypercubes;International Journal of Computer Mathematics: Computer Systems Theory;2016-01-02
5. A note on the cubical dimension of new classes of binary trees;Czechoslovak Mathematical Journal;2015-03