Sensitive Distance and Reachability Oracles for Large Batch Updates
Offered By: IEEE via YouTube
Course Description
Overview
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.
Syllabus
Sensitive Distance and Reachability Oracles for Large Batch Updates
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Data Visualization GUIs with Dash and PythonYouTube How to Get Started With Graph ML - Blog Walkthrough
Aleksa Gordić - The AI Epiphany via YouTube Temporal Graph Networks - GNN Paper Explained
Aleksa Gordić - The AI Epiphany via YouTube Parallel Batch-Dynamic Graph Representations
Simons Institute via YouTube Dynamic Algorithms for Center on Graphs
Simons Institute via YouTube