BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Local algorithms on bounded degree graphs - Endre Csóka (Rényi I
 nstitute and University of Warwick)
DTSTART:20130117T143000Z
DTEND:20130117T153000Z
UID:TALK42446@talks.cam.ac.uk
CONTACT:Andrew Thomason
DESCRIPTION:We focus on the question of which properties and parameters of
  a very large bounded-degree graph can be estimated by a constant-time sam
 pling from the graph. A strongly related concept is the local algorithm on
  bounded-degree graphs\, which means that we construct a\nstructure\, say 
 a large independent set\, in such a way that we decide about each vertex d
 epending only on its constant radius neighbourhood.\n\nI will give a brief
  introduction to these topics with some recent results\, open questions\, 
 and connections to other topics.\n
LOCATION:MR12
END:VEVENT
END:VCALENDAR