Groups
Category
The Hungarian algorithm solves the square assignment problem (matching n workers to n jobs) in O(n^{3}) time using a clever potential (label) function on vertices.
Edmonds' Blossom Algorithm finds a maximum matching in any undirected graph, not just bipartite ones.