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.
Fast Dynamic Cuts, Distances and Effective Resistance via Vertex Sparsifier
Overview
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
-
On Dynamic Graph Approximations - The Case of J-Trees
-
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
-
Dynamic Graph Algorithms - What We Know and What We Don't - Richard M. Karp Distinguished Lecture
-
Towards Better Approximation of Graph Crossing Number
-
Inapproximability of Clustering in Lp Metrics
-
Sublinear Algorithms for Gap Edit Distance
