|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 listsSir Brian Pippard Memorial Meeting novartis Rainbow Group Seminars
Other talksCambridge Assessment Network: Validity Unpacked ‘No Smiling Please’: Northcote Thomas’ ethnographic portraits of southern Nigeria Babbage Lecture Series: Lord Sainsbury of Turville Estimation with Incomplete State Information in the Smart Grid Modeling Tumorigenesis and Drug Resistance in Three Dimensions Exotic defect structures in a strongly confined chiral liquid crystal