Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, May 19, 2020, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Pascal Su
Finding Hamilton cycles in graphs in general is NP-Hard. However, if we look at an 'average' case, that is a random graph, many questions around Hamilton cycles prove to be much easier. I will talk about some results on existence and algorithms for Hamilton cycles in random graphs.
Automatic MiSe System Software Version 1.4803M | admin login