|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 listsFestival of the Annunciation, Fitzwilliam Museum Zoology Department - Seminars and Events EPRG Energy and Environment Seminar Series
Other talksImmigrant Access in the Affordable Care Act: Legacies of the Confederacy Innate Immunity: The first line of defence Constraining the distribution of AGN accretion rates across the galaxy population Mitochondrial optic neuropathies and beyond: the common theme of mitochondrial dynamics and mechanistic insights Every Body Matters: Using Action Research to Work Towards Injury Prevention and Health Promotion in Elite Young Instrumental Musicians at a Specialist Music School Understanding conflicting results in the speech perception literature: methodologies, problems and findings regarding cognitive contributions