|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Local algorithms on bounded degree graphs
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.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsSpring School 2008 - Translating animal models to patients with Neurodegenerative disorders Zoology Department - Tea Talks Cambridge International Forum for Development
Other talksLighting the Future: Next generation LED lighting to save energy and improve our health Ripping up the Rule Book in Formula One Plenary Lecture 14: Ecosystems Biology: from data to control of microbial communities Scope of String Theory The 2015 Vaccine Summit How Stressed Can Stabled Horses Be? The Development of a Behaviour Stress Scale to Assess the Welfare of Stabled Horses