Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time

Dynamic Approximate Shortest Paths and Beyond - Subquadratic and Worst Case Update Time

Explore cutting-edge research on dynamic graph algorithms in this 20-minute IEEE conference talk by Jan van den Brand and Danupon Nanongkai. Delve into the latest advancements in dynamic approximate shortest paths, focusing on subquadratic and worst-case update time complexities. Gain insights into innovative techniques for maintaining shortest paths in rapidly changing graph structures, and discover how these algorithms can be applied to solve real-world problems efficiently.