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

YouTube

Finding Perfect Matchings in Bipartite Hypergraphs

Hausdorff Center for Mathematics via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 29-minute lecture on finding perfect matchings in bipartite hypergraphs, presented by Chidambaram Annamalai at the Hausdorff Center for Mathematics. Delve into Haxell's condition, a hypergraph analog of Hall's condition, and its implications for perfect matchings in bipartite hypergraphs. Discover a new efficient algorithm for finding perfect matchings when a stronger version of Haxell's condition is satisfied, generalizing the classical Hungarian algorithm for bipartite graphs. Examine the potential applications of these techniques in other combinatorial problems involving hypergraphs, such as Set Packing. Follow the lecture's structure, covering introduction, definitions, hypothesis, examples, theorem statement, algorithm details, and analysis.

Syllabus

Introduction
Definition
Hypothesis
Example
Theorem
Algorithm
Details
Analysis

Taught by

Hausdorff Center for Mathematics

Reviews

Start your review of Finding Perfect Matchings in Bipartite Hypergraphs

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.