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

YouTube

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

Simons Institute via YouTube

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

Reviews

Start your review of Recent Progress on Sublinear Time Algorithms for Maximum Matching - Upper Bounds

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.