Restricted rotation distance between binary trees. (Q1853166): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite-dimensional torsion-free \(\text{FP}_{\infty}\) group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-isometrically embedded subgroups of Thompson's group \(F\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics and embeddings of generalizations of Thompson’s group $F$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory notes on Richard Thompson's groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some tree similarity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the upper bound on the rotation distance of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient upper bound of the rotation distance of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(02)00315-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972564423 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Restricted rotation distance between binary trees.
scientific article

    Statements

    Restricted rotation distance between binary trees. (English)
    0 references
    0 references
    21 January 2003
    0 references
    Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rotations used to transform the trees are allowed to be only of two types. Restricted rotation distance is larger than rotation distance, since there are only two permissible locations to rotate, but is much easier to compute and estimate. We obtain linear upper and lower bounds for restricted rotation distance in terms of the number of interior nodes in the trees. Further, we describe a linear-time algorithm for estimating the restricted rotation distance between two trees and for finding a sequence of rotations which realizes that estimate. The methods use the metric properties of the abstract group known as Thompson's group \(F\).
    0 references
    0 references
    0 references
    0 references
    0 references
    Algorithms and data structures
    0 references
    Binary trees
    0 references
    Rotation distance
    0 references
    0 references