Bounding right-arm rotation distances

Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees wi...

Descripción completa

Detalles Bibliográficos
Autores: Cleary, Sean, Taback, Jennifer
Tipo de recurso: artículo
Fecha de publicación:2005
País:España
Institución:Universitat Autònoma de Barcelona
Repositorio:Dipòsit Digital de Documents de la UAB
Idioma:inglés
OAI Identifier:oai:ddd.uab.cat:44153
Acceso en línea:https://ddd.uab.cat/record/44153
Access Level:acceso abierto
Palabra clave:Arbres (Teoria dels grafs)
Descripción
Sumario:Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to transform one tree to the other. We describe several types of rotation distance, and provide upper bounds on distances between trees with a fixed number of nodes with respect to each type. These bounds are obtained by relating each restricted rotation distance to the word length of elements of Thompson's group F with respect to different generating sets, including both finite and infinite generating sets.