Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs - Towards Constructive Matching Sparsifiers

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore dynamic matching algorithms and Ruzsa-Szemerédi graphs in this lecture from the Simons Institute. Delve into the concept of matching sparsifiers and their importance in preserving large matchings in induced subgraphs. Learn about the non-constructive proof by Goel, Kapralov, and Khanna for sparse matching sparsifiers in bipartite graphs, and discover approaches to overcome its limitations. Examine conditionally fast dynamic algorithms for approximate matchings, with a focus on the fully dynamic setting where graphs undergo edge insertions and deletions. Gain insights into maintaining approximate maximum matchings efficiently in dynamic graphs. The lecture draws from recent research on fully dynamic matching, ordered Ruzsa-Szemerédi graphs, and the application of regularity lemma in streaming and dynamic matching problems.

Syllabus

Dynamic Matching and (Ordered) Ruzsa-Szemerédi Graphs: Towards Constructive Matching Sparsifiers

Taught by

Simons Institute

Reviews

Start your review of Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs - Towards Constructive Matching Sparsifiers

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.