|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 listsStem Cell Seminars and Events in Cambridge National Centre for Statistical Ecology (NCSE) Seminars Associative experiment
Other talksEngineered growth factor microenvironments for regenerative medicine 'It's not my story to tell': ownership, legitimacy, and the politics of history in Mocimboa da Praia, Mozambique 'British Imperial Rule in China during the First Opium War (1840-1842)' Accelerating Development in Biomedical Engineering Postgraduate Diploma in Entrepreneurship webinar New Frontiers in Robotics - ONE DAY MEETING