Concepts3
⚙️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
⚙️AlgorithmIntermediate
Bipartite Matching - Kuhn's Algorithm
Kuhn’s algorithm finds a maximum matching in a bipartite graph by repeatedly searching for augmenting paths using DFS.
#bipartite matching#kuhn algorithm#augmenting path+12
⚙️AlgorithmAdvanced
Minimum Cost Maximum Flow
Minimum Cost Maximum Flow (MCMF) finds the maximum possible flow from a source to a sink while minimizing the total cost paid per unit of flow along edges.
#minimum cost maximum flow#successive shortest augmenting path#reduced cost+11