Graph Matching: Hopcroft-Karp Algorithm
Overview
algorithm
Graph Matching: Augmenting Path
Introduction
Network Flow: Push-relabel algorithm
According to CLRS: Many of the asymptotically fastest maximum-flow algorithms are push-relabel algorithms, and the fastest actual implementations of maximum-flow algorithms are based on the push-relabel method. Push-relabel methods also efficientl...
Network Flow: Ford-Fulkerson Method
Basic method (framework) is Ford-Fulkerson. It’s called a “method” because it’s general, there can be different implementation that yield different complexity. It looks like this: