Fast Dynamic Cuts, Distances and Effective Resistance via Vertex Sparsifier
Offered By: IEEE via YouTube
Course Description
Overview
Explore cutting-edge research in dynamic graph algorithms through this 24-minute IEEE conference talk. Delve into the innovative framework of vertex sparsification and its applications in fast dynamic cuts, distances, and effective resistance. Learn about incremental meta theorems, tree-based graph approximations, and J3 graphs as presenters Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, and Thatchaphol Saranurak from prestigious institutions share their groundbreaking work. Gain insights into the construction and dynamics of these algorithms, and understand their potential impact on the field of computer science and graph theory.
Syllabus
Introduction
Dynamic Graph Algorithms
General Framework
Vertical Specification
Why Vertex Specification
Incremental Meta Theorem
New Algorithms
Treebased graph approximation
J3 graphs
Construction
Dynam
Conclusion
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube