The Hopcroft–Karp algorithm is the most efficient way to find a maximum cardinality matching in a bipartite graph. Think of applicants for jobs, each applicant has skills for a certain sub-set of the ...