YoVDO

Recent Progress on Sublinear Time Algorithms for Maximum Matching - Upper Bounds

Offered By: Simons Institute via YouTube

Tags

Algorithm Design Courses Graph Theory Courses Dynamic Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore recent advancements in sublinear time algorithms for estimating maximum matching size in graphs during this one-hour lecture by Soheil Behnezhad from Northeastern University. Discover how progress in this field has resolved a longstanding open problem in dynamic graphs. Gain insights into existing sublinear time matching algorithms and their applications. Delve into the motivation behind developing algorithms that run faster than linear time, pushing the boundaries of traditional algorithm design. Learn about the connection between sublinear time algorithms and dynamic graph problems, highlighting the broader impact of this research area.

Syllabus

Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds


Taught by

Simons Institute

Related Courses

Data Visualization GUIs with Dash and Python
YouTube
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