Groups
Category
Tree DP solves matching, vertex cover, and independent set on trees in linear time using small state transitions per node.
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).