Jump to main content
Chair of Theoretical Computer Science and Information Security
Chair of Theoretical Computer Science and Information Security

Finding Large Cliques in Random Graphs.

Talking persons:
M.Sc. Michael Reißner
Abstract:
We discuss an algorithm which finds large cliques in random graphs. A central tool will be the investigation of the qotients of the Lovasz-number and the clique number of the graphs under consideration.
Times:
Tuesday 29th May 2012, 5.15 pm - 6.45 pm, room 1/368