- Series
- ACO Student Seminar
- Time
- Friday, October 4, 2019 - 1:05pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Thatchaphol Saranurak – CS, Toyota Technological Institute at Chicago – thatchaphol.s@gmail.com – https://sites.google.com/site/thsaranurak/
- Organizer
- He Guo
Expander decomposition has been a central tool in designing graph algorithms in many fields (including fast centralized algorithms, approximation algorithms and property testing) for decades. Recently, we found that it also gives many impressive applications in dynamic graph algorithms and distributed graph algorithms. In this talk, I will survey these recent results based on expander decomposition, explain the key components for using this technique, and give some toy examples on how to apply these components.