Computer Science/Discrete Mathematics Seminar II
Using Expanders for Fast Graph Algorithms
In the last few years, expanders have been used in fast graph algorithms in different models, including static, dynamic, and distributed algorithms. I will survey these applications of expanders, explain the expander-related tools behind this development, then give a tutorial on how to construct some of these tools, such as expander decomposition.
Date & Time
May 09, 2023 | 10:30am – 12:30pm
Location
Simonyi Hall 101 and Remote AccessSpeakers
Thatchaphol Saranurak
Affiliation
University of Michigan