The Matching Problem in General Graphs is in Quasi-NC
The Matching Problem in General Graphs is in Quasi-NC - Ola Svensson
Bipartite perfect matching is in quasi-NC - Fenner
MA 757 Graph Theory - Stable Matching Algorithm
Mini-course "The matching problem". Lecture 1 (Stephen Fenner)
Mini-course "The matching problem". Lecture 2 (Stephen Fenner)
Rohit Gurjar: Bipartite matching is in quasi-NC - צילום הרצאות סטודיו האנה בי
what is matching of a graph
Graph Theory - Matchings in general graphs (Lecture 15)
Graph Theory - Matching Problems
Unit 6 Class 28: Matching
3.1.B: Planar Graph Perfect Matching is in NC
Graph Theory 6-2: Well Quasi Ordering
Algorithms for bipartite matching problems with connections to sparsification and streaming
Tutte’s Matrices and Matchings in Arbitrary Graphs
Randomized Online Matching in Regular Graphs
Lecture5 Matchings in general graphs (1/2) #MAS477 Introduction to Graph Theory #KAIST
mod09lec45 - Search Bipartite Perfect Matching is in RNC: Part 1
Class 14: Matching
Jian Ding (Peking University), Recent progress on random graph matching problems, 7th Feb 2023
