Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 22, 2020, 12:15 pm
Duration: 30 minutes
Location: Zoom: conference room
Speaker: Yi-Jun Chang
In this talk, we will discuss a recent line of research in distributed graph algorithms in the CONGEST model that exploit expanders. All these algorithms so far are based on two tools: expander decomposition and expander routing. An expander decomposition removes a small fraction of the edges so that the remaining connected components have high conductance, and expander routing allows each vertex v in a high-conductance component to very quickly exchange deg(v) messages with any other vertices in the same component, not just its local neighbors. This talk will focus on my recent work with Thatchaphol Saranurak in FOCS 2020 (arxiv.org/abs/2007.14898), where we gave the first efficient deterministic distributed algorithms for both tools.
Automatic MiSe System Software Version 1.4803M | admin login