Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, December 18, 2018, 12:15 pm

**Duration**: 30 minutes

**Location**: OAT S15/S16/S17

**Speaker**: Jean Cardinal (Université Libre de Bruxelles (ULB))

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 will review known results on associahedra, then consider graph associahedra 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 log n). This implies that the worst-case diameter of tree associahedra is Θ(n log n), which answers a question from Thibault Manneville and Vincent Pilaud.

Joint work with Stefan Langerman and Pablo Pérez-Lantero, to appear in the Electronic Journal of Combinatorics.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login