#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/maximum-bipartite-matching

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/graph-theory/maximum-bipartite-matching

Lessons

1. Intro

2. What Is a Matching

3. Maximum Matching

Practice Problems

Ready to start learning?

4. Perfect Matching

5. Augmenting Paths

6. Why Augmenting Paths Work

7. Finding Augmenting Paths

8. Kuhn's Algorithm

9. Kuhn's Algorithm - Pseudocode

10. Problem - School Dance

11. Problem - School Dance - Read Statement

12. School Dance - Important idea

13. School Dance - Algorithm

14. School Dance - Implementation

15. School Dance - Walkthrough

16. School Dance - Lessons

17. Reduction to Max Flow

18. Why Max Flow Works

19. König's Theorem

20. Proof Idea of König's Theorem

21. Hall's Marriage Theorem

22. Checking Hall's Condition

23. Application - Job Assignment

24. Application - Scheduling

25. Problem - Maximum Matching

26. Maximum Matching - Important idea

27. Maximum Matching - Implementation

28. Maximum Matching - Walkthrough

29. Maximum Matching - Lessons

30. Problem - Assign Cookies

31. Assign Cookies - Greedy Solution

32. Assign Cookies - Matching Solution

33. Assign Cookies - Implementation

34. Assign Cookies - Lessons

35. Weighted Bipartite Matching

36. Online Bipartite Matching

37. Common Mistakes

38. Improvement - Early Termination

39. Hopcroft-Karp Algorithm

40. When to Use Each Algorithm

41. Minimum Vertex Cover from Matching

42. Minimum Edge Cover

43. Maximum Independent Set

44. Checklist - Bipartite Matching

45. Section 32 Recap