Graph matchings

Problems on graph matchings, including maximum matching in bipartite graphs, assigning workers to jobs, placing rooks and dominoes, minimum vertex cover, the assignment problem with costs, and stable marriages.

Kuhn's algorithm builds on depth-first search. Related problem sets are under Graph network flows and Graphs.