Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, December 07, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Konstantinos Panagiotou
Graph coloring and more generally random graphs have become one of the most prominent branches of combinatorics and combinatorial optimization. One of the most striking features of this field is the variety of methods and tools used to tackle its central problems. In this talk, a brief overview of the devised knowledge will be given, in particular known results about the chromatic number, pros und cons of the Greedy algorithm, coloring sparse graphs and the property of unique colorability.
Automatic MiSe System Software Version 1.4803M | admin login