Concepts2
⚙️AlgorithmIntermediate
Bipartite Matching - Kuhn's Algorithm
Kuhn’s algorithm finds a maximum matching in a bipartite graph by repeatedly searching for augmenting paths using DFS.
#bipartite matching#kuhn algorithm#augmenting path+12
⚙️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