Concepts2
⚙️AlgorithmAdvanced
Hungarian Algorithm
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.
#hungarian algorithm#assignment problem#bipartite matching+11
⚙️AlgorithmAdvanced
General Matching - Blossom Algorithm
Edmonds' Blossom Algorithm finds a maximum matching in any undirected graph, not just bipartite ones.
#blossom algorithm#edmonds matching#general graph matching+12