On the Diameter of Tree Associahedra

03/30/2018
by   Jean Cardinal, et al.
0

We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be modified by local operations called rotations, which generalize rotations in binary search trees. The rotation graph of search trees on a graph G is the skeleton of a polytope called the graph associahedron of G. We consider the case where the graph G is a tree. We construct a family of trees G on n vertices and pairs of search trees on G such that the minimum number of rotations required to transform one search tree into the other is Ω (n n). This implies that the worst-case diameter of tree associahedra is Θ (n n), which answers a question from Thibault Manneville and Vincent Pilaud. The proof relies on a notion of projection of a search tree which may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2021

Bounds on the Diameter of Graph Associahedra

Graph associahedra are generalized permutohedra arising as special cases...
research
10/02/2020

Splay trees on trees

Search trees on trees (STTs) are a far-reaching generalization of binary...
research
10/25/2021

The diameter of caterpillar associahedra

The caterpillar associahedron 𝒜(G) is a polytope arising from the rotati...
research
08/08/2018

Modified box dimension of trees and hierarchical scale-free graphs

In this paper, we introduce a new concept: the modified box dimension of...
research
03/05/2018

Controlled quantum search on structured databases

We present quantum algorithms to search for marked vertices in structure...
research
07/14/2023

Graph Search Trees and Their Leaves

Graph searches and their respective search trees are widely used in algo...
research
01/15/2020

Optimal Skeleton Huffman Trees Revisited

A skeleton Huffman tree is a Huffman tree in which all disjoint maximal ...

Please sign up or login with your details

Forgot password? Click here to reset