Graph Theory, Lecture 34: The Gallai-Edmonds matching theorem

(38:14)

Gallai-Edmonds Percolation by Kedar Damle

(48:38)

Selected Topics in Graph Theory, lecture 1: matchings

(1:22:5)

Ferenc Bencs: Atoms of the matching measure

(1:10:46)

The Blossom Algorithm

(6:9)

Mod-03 Lec-22 Gallai-Roy theorem, Acyclic coloring, Hadwiger's conjecture

(54:3)

Aspects of Edmonds' Blossom Algorithm for perfect matching

(7:15)

Kidney Exchange: Algorithms and Incentives

(58:55)

Dispelling an Old Myth about an Ancient Algorithm

(1:14:12)

When Matching Meets Batching: Optimal Multi-stage Algorithms and Applications

(1:2:16)

Planar Maximum Matchings: Towards a parallel algorithm -- Samir Datta

(48:56)

Lecture 12: Matching in General Graphs: Edmonds’ Blossom Algorithm

(26:)

Stefan Lendl - Continuous Facility Location on Graphs

(31:36)

B2.A – A Scaling Algorithm for Weighted f-Factors in General Graphs

(21:18)

The Edmonds-Karp Algorithm - GT - Computability, Complexity, Theory: Algorithms

(49)

Shoham Letzter (UCL), An improvement on Łuczak's connected matchings method, 3rd November 2020

(54:23)