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 条
  • [31] EFFICIENT GENERATION OF K-ARY TREES IN NATURAL ORDER
    ER, MC
    COMPUTER JOURNAL, 1992, 35 (03): : 306 - 308
  • [32] Optimal parallel algorithm for generating k-ary trees
    Vajnovszki, V
    Phillips, C
    COMPUTERS AND THEIR APPLICATIONS: PROCEEDINGS OF THE ISCA 12TH INTERNATIONAL CONFERENCE, 1997, : 201 - 204
  • [33] Loopless generation of Gray codes for k-ary trees
    Korsh, JE
    LaFollette, P
    INFORMATION PROCESSING LETTERS, 1999, 70 (01) : 7 - 11
  • [34] Depth of nodes in random recursive k-ary trees
    Javanian, M
    Vahidi-Asl, MQ
    INFORMATION PROCESSING LETTERS, 2006, 98 (03) : 115 - 118
  • [35] An improved succinct representation for dynamic k-ary trees
    Arroyuelo, Diego
    COMBINATORIAL PATTERN MATCHING, 2008, 5029 : 277 - 289
  • [36] Non-blocking k-ary search trees
    Theory Group, Dept. of Computer Science, University of Toronto, Canada
    不详
    Lect. Notes Comput. Sci., (207-221):
  • [37] Non-blocking k-ary Search Trees
    Brown, Trevor
    Helga, Joanna
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2011, 7109 : 207 - +
  • [38] Line-broadcasting in complete k-ary trees
    Shabtai, Revital Hollander
    Roditty, Yehuda
    NETWORKS, 2016, 67 (02) : 139 - 147
  • [39] Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees
    Rosena R. X. Du
    Jia He
    Xueli Yun
    Graphs and Combinatorics, 2019, 35 : 221 - 229
  • [40] Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees
    Du, Rosena R. X.
    He, Jia
    Yun, Xueli
    GRAPHS AND COMBINATORICS, 2019, 35 (01) : 221 - 229
12345