Register
|
Login
HOME
PROBLEMSET
ROADMAP
COMPETITION
TOPIC
RANKING
GUIDE
MASHUP
ABOUT
CONTACT
Module Bipartite Matching
Bipartite Matching
**Frequency: 2/10**
Resources
- [CP Algorithms: Kuhn's Algorithm for Maximum Bipartite Matching](https://cp-algorithms.com/graph/kuhn_maximum_bipartite_matching.html)
Problems
Chores 1
52 / 57
1400
Chores 2
27 / 30
1600
Hard decision
15 / 18
1700
Data structure
Sweep Line
Introduction to Trie
Square root decomposition
Tree
Rerooting
Small-to-large
Heavy-light decomposition
Graph
Strongly connect component
Articulation point and bridge
Bipartite Matching
Dynamic Programming
Digit DP
Matrix multiplication
Hashing
Hash a set
Others
Divide and conquer
Geometry
Geometry
Binary search
Parallel binary search
Others
Additional Problems (Level 5)