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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, May 07, 2015, 12:15 pm

**Duration**: 30 minutes

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

**Speaker**: Pedro Vieira

We discuss a new setting of algorithmic problems in random graphs, studying the minimum number of queries one needs to ask about the adjacency between pairs of vertices of G(n,p) in order to typically find a subgraph possessing a certain structure. More specifically, given a monotone property of graphs P, we consider G(n,p) where p is above the threshold probability for P and look for adapative algorithms which query significantly less than the \binom{n}{2} pairs of vertices in order to reveal that the property P holds with high probability. In this talk we focus particularly on the properties of containing a Hamilton cycle and containing paths of linear size.

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

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