Restricted rotation distance between k-ary trees

被引：0
|
作者：
Cleary S. [1 ,2 ]
机构：
[1] The City College of New York, United States
[2] The CUNY Graduate Center, United States
来源：
Journal of Graph Algorithms and Applications | 2023年 / 27卷 / 01期
关键词：
Clustering algorithms - Trees (mathematics);
D O I：
10.7155/jgaa.00611
中图分类号：
学科分类号：
摘要：
We study restricted rotation distance between ternary and higher-valence trees using approaches based upon generalizations of Thompson’s group F. We obtain bounds and a method for computing these distances exactly in linear time, as well as a linear-time algorithm for computing rotations needed to realize these dis-tances. Unlike the binary case, the higher-valence notions of rotation distance do not give Tamari lattices, so there are fewer tools for analysis in the higher-valence settings. Higher-valence trees arise in a range of database and filesystem applications where balance is important for efficient performance. © 2023, Brown University. All rights reserved.
引用
收藏
页码：19 / 33
页数：14
相关论文
共 50 条
  • [21] Generating regular k-ary trees efficiently
    Xiang, LM
    Ushijima, K
    Akl, SG
    COMPUTER JOURNAL, 2000, 43 (04): : 290 - 300
  • [22] THE REPRESENTATION AND ENUMERATION OF ORDERED K-ARY TREES
    MARTIN, HW
    KILTINEN, JO
    MCNEILL, RB
    COMPUTING AND INFORMATION, 1989, : 105 - 109
  • [23] Loop free generation of k-ary trees
    Roelants Van Baronaigien, Dominique
    American Journal of Mathematical and Management Sciences, 2000, 20 (1-2) : 183 - 200
  • [24] Note on the Exponential Recursive k-Ary Trees
    Ghasemi, Mina
    Javanian, Mehri
    Nabiyyi, Ramin Imany
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2023, 57 : 16 - 32
  • [25] k-Ary spanning trees contained in tournaments
    Ai, Jiangdong
    Lei, Hui
    Shi, Yongtang
    Yao, Shunyu
    Zhang, Zan-Bo
    DISCRETE APPLIED MATHEMATICS, 2020, 285 : 141 - 146
  • [26] BRANCHES IN RANDOM RECURSIVE k-ARY TREES
    Javanian, M.
    Vahidi-Asl, M. Q.
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2012, 38 (02) : 323 - 331
  • [27] On generating k-ary trees in computer representation
    Xiang, LM
    Ushijima, K
    Tang, CJ
    INFORMATION PROCESSING LETTERS, 2001, 77 (5-6) : 231 - 238
  • [28] Antimagic orientations for the complete k-ary trees
    Chen Song
    Rong-Xia Hao
    Journal of Combinatorial Optimization, 2019, 38 : 1077 - 1085
  • [29] Complete k-ary trees and Hamming graphs
    Choudum, S. A.
    Lavanya, S.
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2009, 45 : 15 - 24
  • [30] Scaling limits of k-ary growing trees
    Haas, Benedicte
    Stephenson, Robin
    ANNALES DE L INSTITUT HENRI POINCARE-PROBABILITES ET STATISTIQUES, 2015, 51 (04): : 1314 - 1341
12345