Introduction to Length-Constrained Expanders and Expander Decompositions

Explore the powerful concept of Length-Constrained Expanders and Expander Decompositions in this 55-minute Google TechTalk presented by Bernhard Haeupler. Dive into the world of graph and network optimization algorithms, learning how these tools have become essential for solving complex problems. Discover how Length-Constrained Expanders generalize traditional expanders, simultaneously controlling both flows and lengths in networks. Gain insights into the applications of these concepts and understand their significance in various fields of computer science. Benefit from Dr. Haeupler's expertise as they guide you through the fundamentals of expanders, hop-constrained expanders, and their decompositions, providing a solid foundation for further exploration in algorithm design, distributed computing, and network optimization.

Introduction to Length-Constrained Expanders and Expander Decompositions