|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 listsMemory at War Europe East and West: Film, History, and Mourning DPMMS Lists
Other talksDimers on Rail Yard Graphs Inter-individual variability of chaperone transcription, its causes and consequences The Army of General Anders: Legions from a Lost World How on Earth? Welcome to a Post-Growth, Not-For-Profit World Global Economic Development and the Anthropocene Identity Matters in Language Education