Concepts3
⚙️AlgorithmIntermediate
Bipartite Matching - Hopcroft-Karp
Hopcroft–Karp computes maximum matching in a bipartite graph in O(E \sqrt{V}) time, which is asymptotically faster than repeated DFS (Kuhn's algorithm).
#hopcroft karp#bipartite matching#augmenting path+11
⚙️AlgorithmIntermediate
König's Theorem
König's Theorem states that in any bipartite graph, the size of a maximum matching equals the size of a minimum vertex cover.
#konig's theorem#bipartite matching#minimum vertex cover+12
⚙️AlgorithmIntermediate
Flow - Modeling Techniques
Many classic problems can be modeled as a maximum flow problem by building the right network and capacities.
#max flow#dinic#bipartite matching+12