Sensitive Distance and Reachability Oracles for Large Batch Updates

Sensitive Distance and Reachability Oracles for Large Batch Updates

Explore cutting-edge research on sensitive distance and reachability oracles for large batch updates in this 20-minute IEEE conference talk presented by Jan van den Brand and Thatchaphol Saranurak. Gain insights into advanced algorithms and data structures designed to efficiently handle dynamic graph problems, focusing on maintaining distance and reachability information in the face of multiple simultaneous edge updates. Discover how these innovative approaches can significantly improve the performance of graph-based applications in various domains, including network analysis, transportation systems, and social network modeling.