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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, October 18, 2007, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Andreas Razen

Transforming Perfect Matchings

For a planar point set we consider the graph of crossing-free straight-line perfect matchings where two perfect matchings are adjacent if their union is crossing-free. In 2005 Houle et al. showed that this graph is connected and gave an upper bound of $n-2$ for its diameter, $n$ being the number of given points. Recently, this upper bound was improved to $O(log n)$ by Aichholzer et al.

We prove a lower bound of $\Omega( log n / log log n )$ for the diameter of this graph. So far only constant lower bounds were known.

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