Concepts5
⚙️AlgorithmIntermediate
Bipartite Matching - Hopcroft-Karp
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).
#hopcroft karp#bipartite matching#augmenting path+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
⚙️AlgorithmIntermediate
König's Theorem
König's Theorem states that in any bipartite graph, the size of a maximum matching equals the size of a minimum vertex cover.
#konig's theorem#bipartite matching#minimum vertex cover+12
⚙️AlgorithmIntermediate
Min-Cut Max-Flow Theorem
The Max-Flow Min-Cut Theorem says the maximum amount you can push from source to sink equals the minimum total capacity you must cut to disconnect them.
#max flow#min cut#edmonds karp+12
⚙️AlgorithmIntermediate
Maximum Flow - Ford-Fulkerson
Ford–Fulkerson finds the maximum possible flow from a source to a sink by repeatedly pushing flow along an augmenting path in the residual graph.
#maximum flow#ford-fulkerson#edmonds-karp+10