LP&CO 2026 Lecture-36

Name: LP&CO 2026 Lecture-36
Uploaded: 2026-10-26T00:00:00.000Z
Duration: 1 h 5 min 41 s
Description: This lecture works through the progress rules of a matching algorithm and whether an \(n^4\)-style bound on that specific method is tight, then explains why a graph has no perfect matching: some vertex set \(T\) whose...

Nishad-Kothari-IIT-Madras · 65:41 · Watch on YouTube

This lecture works through the progress rules of a matching algorithm and whether an \(n^4\)-style bound on that specific method is tight, then explains why a graph has no perfect matching: some vertex set \(T\) whose...

Read the full summary on retube