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

Finding algorithmically large complete subgraphs in random graphs

Talking persons:
M.Sc. Michael Reißner
Abstract:
In this talk algorithms for finding large cliques in random graphs will be discussed. Basic tool here is the quotient of Lovasz-number and clique-number.
Times:
Monday 29th October 2012, 3.30 pm - 5.00 pm, room 1/368