Groups
Category
Level
Tree DP solves matching, vertex cover, and independent set on trees in linear time using small state transitions per node.
Edmonds' Blossom Algorithm finds a maximum matching in any undirected graph, not just bipartite ones.
Kuhn’s algorithm finds a maximum matching in a bipartite graph by repeatedly searching for augmenting paths using DFS.
König's Theorem states that in any bipartite graph, the size of a maximum matching equals the size of a minimum vertex cover.