![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Combinatorics Seminar > Local algorithms on bounded degree graphs
Local algorithms on bounded degree graphsAdd to your list(s) Download to your calendar using vCal
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 listsContinuity in Education and Cultural links between countries: Brexit Talk and Q&A Kettle's Yard 50th anniversary Cambridge AssessmentOther talksSaving the People of the Forest: one chocolate bar and one nebulizer treatment at a time The homelands of the plague: Soviet disease ecology in Central Asia, 1920s–1950s Social support and breastfeeding in the UK: evolutionary perspectives and implications for public health Metamaterials and the Science of Invisibility Modelling mitochondrial dysfunction in Parkinson’s disease: mitophagy, calcium and beyond Prof Kate Jones (UCL): Biodiversity & Conservation |