|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 listsEngineering for the Life Sciences Seminars Cambridge University Geographical Society Cambridge University Computing and Technology Society (CUCaTS)
Other talksHIFs, mitochondria and cardioprotection From disease ecology to disease control: is elimination of rabies possible Lunchtime Talk: Helen's Bedroom Variation in measures and markers of timeliness of diagnosis in cancer Confirmatory Testing for a Beneficial Treatment Effect in Dose-Response Studies using MCP-Mod and an Adaptive Interim Analysis Graphene Electronics In Biomedical Applications