Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
Offered By: IEEE via YouTube
Course Description
Overview
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
Aplicaciones de la teoría de grafos a la vida realMiríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer