In the
mathematical discipline of
graph theory, a
matching or
independent edge set in a
graph is a set of
edges without common
vertices. It may also be an entire graph consisting of edges without common vertices. Bipartite matching is a special case of a
network flow problem.