Dynamic Graph Algorithms - What We Know and What We Don't - Richard M. Karp Distinguished Lecture

Explore the fascinating world of dynamic graph algorithms in this Richard M. Karp Distinguished Lecture delivered by Monika Henzinger from the Institute of Science and Technology Austria (ISTA). Dive into the evolution of this critical field, which began in the 1980s and has since become integral to breakthrough developments in static graph algorithms. Discover how these data structures maintain information about graphs as they undergo modifications through local operations like edge or vertex insertions and deletions. Learn about real-world applications, including maintaining clusters in large social networks and their role as subroutines in static graph algorithms. Gain insights into the state-of-the-art techniques, recent advancements, and open questions that continue to challenge researchers in this domain. Benefit from the expertise of Monika Henzinger, a distinguished professor and recipient of numerous accolades, as she shares her extensive knowledge and experience in this comprehensive 1-hour and 12-minute lecture.

Dynamic Graph Algorithms: What We Know and What We Don’t | Richard M. Karp Distinguished Lecture