Groups
DP on trees is a technique that computes answers for each node by combining results from its children using a post-order DFS.
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).