Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, April 26, 2016, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Frank Mousset
How quickly can k agents explore a graph on n vertices? I will talk about this problem and show a simple construction that gives a pretty good lower bound.
Automatic MiSe System Software Version 1.4803M | admin login