|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 listsMicroelectronics Group Seminar Friday Morning Seminars, Dept of Veterinary Medicine CRASSH
Other talksEvolutionary hypotheses and early human development: findings from the Wirral Child Health and Development Study Structure, Biology and Therapeutic Potential of Novel ER Located Growth Factors Bayesian sequential design in matrix factorisation models Biomedical Engineering: problem solving using clinical and biomedical applications Woofing it down – lessons on the neurobiology of appetite from man’s best friend Project Management Under Uncertainty