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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, June 28, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Manuel Huber

Algorithmic Aspects of Szemerédi's Regularity Lemma

Szemerédi's Regularity Lemma has proven to be one of the most important tools in extremal graph theory in the recent years. Furthermore since the discovery of the constructive version by Alon et al. the lemma gave rise to numerous algorithmic applications. We will present an aproximation algorithm for dense instances of MAX-Cut and show how to generalise this approach using the sparse Regularity Lemma. Finally we sketch the proof of the algorithmic version of the sparse Regularity Lemma.


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

Previous talks by year:   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