Counting difficult tree pairs with respect to the rotation distance problem

01/17/2020
by   Sean Cleary, et al.
0

Rotation distance between rooted binary trees is the minimum number of simple rotations needed to transform one tree into the other. Computing the rotation distance between a pair of rooted trees can be quickly reduced in cases where there is a common edge between the trees, or where a single rotation introduces a common edge. Tree pairs which do not have such a reduction are difficult tree pairs, where there is no generally known first step. Here, we describe efforts to count and estimate the number of such difficult tree pairs, and find that the fraction decreases exponentially fast toward zero. We also describe how knowing the number of distinct instances of the rotation distance problem is a helpful factor in making the computations more feasible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/17/2020

An efficient sampling algorithm for difficult tree pairs

It is an open question whether there exists a polynomial-time algorithm ...
research
06/03/2022

gcd-Pairs in ℤ_n and their graph representations

This research introduces a gcd-pair in ℤ_n which is an unordered pair {[...
research
05/01/2020

Distributions of restricted rotation distances

Rotation distances measure the differences in structure between rooted o...
research
04/08/2023

On Rotation Distance of Rank Bounded Trees

Computing the rotation distance between two binary trees with n internal...
research
11/16/2018

A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees

In 2001 Allen and Steel showed that, if subtree and chain reduction rule...
research
12/02/2019

A Generalized Matrix-Tree Theorem for Pfaffian Pairs

The matrix-tree theorem counts the number of spanning trees of undirecte...
research
06/09/2015

Compact Shape Trees: A Contribution to the Forest of Shape Correspondences and Matching Methods

We propose a novel technique, termed compact shape trees, for computing ...

Please sign up or login with your details

Forgot password? Click here to reset