flow of value k

↔

matching of size k

Generalized Matching

Which network flow algorithm to use

FF: O(|E|·v(f^h))

EK: O(|E|^2|v|)

Sc: O(|E|^2·logC)

|V| = n+m+2

|E| ≤ n·m

v(f*) ≤ min(2n,m)