YoVDO

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs

Offered By: IEEE via YouTube

Tags

Graph Algorithms Courses Computer Science Courses Graph Theory Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking IEEE conference talk on bipartite matching algorithms for moderately dense graphs. Delve into the collaborative research presented by experts from renowned institutions, including KTH, University of Washington, Microsoft Research, Georgia Tech, TTI Chicago, Stanford, Princeton, IAS, and Google Research. Learn about innovative techniques that achieve nearly-linear time complexity for solving bipartite matching problems on moderately dense graph structures. Gain insights into the latest advancements in graph theory and algorithmic efficiency during this 24-minute presentation.

Syllabus

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Probabilistic Graphical Models 1: Representation
Stanford University via Coursera Computer Security
Stanford University via Coursera Intro to Computer Science
University of Virginia via Udacity Introduction to Logic
Stanford University via Coursera Internet History, Technology, and Security
University of Michigan via Coursera