University of Cambridge > > Combinatorics Seminar > Local algorithms on bounded degree graphs

Local algorithms on bounded degree graphs

Add to your list(s) Download to your calendar using vCal

  • UserEndre Csóka (Rényi Institute and University of Warwick)
  • ClockThursday 17 January 2013, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

We focus on the question of which properties and parameters of a very large bounded-degree graph can be estimated by a constant-time sampling from the graph. A strongly related concept is the local algorithm on bounded-degree graphs, which means that we construct a structure, say a large independent set, in such a way that we decide about each vertex depending only on its constant radius neighbourhood.

I will give a brief introduction to these topics with some recent results, open questions, and connections to other topics.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity