skip to content
 

The cover time of sparse random graphs $G_{n,p}$, $p=c \log n$, $c>1$, and related problems

Presented by: 
C Cooper [Goldsmiths]
Date: 
Tuesday 6th August 2002 - 16:00 to 17:00
Venue: 
INI Seminar Room 1
Session Title: 
Randomised Algorithms
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons