YoVDO

Fast Dynamic Cuts, Distances and Effective Resistance via Vertex Sparsifier

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Graph Theory Courses Algorithm Design Courses

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

Natural Language Processing
Columbia University via Coursera
Intro to Algorithms
Udacity
Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX