Concepts2
⚙️AlgorithmIntermediate
Tree DP - Matching and Covering
Tree DP solves matching, vertex cover, and independent set on trees in linear time using small state transitions per node.
#tree dp#maximum matching#vertex cover+12
⚙️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