LP&CO 2026 Lecture-37
Nishad-Kothari-IIT-Madras · 49:39 · Watch on YouTube
The video is a lecture on Edmonds' blossom algorithm for general (non-bipartite) graph matching: the lecturer reviews Tutte's condition, shows why alternating-tree search stalls in non-bipartite graphs, and motivates...