maximum independent set | maximum matching

An independent edge set, also called a matching, of a graph G is a subset of the edges such that no two edges in the subset share a vertex in G. A maximum independent edge set an independent edge set containing the largest possible number of edges among all independent edge sets for a given graph. A maximum independent edge set, also called a maximum matching, of a graph can be computed in the Wolfram Language with FindIndependentEdgeSet[g]. The size of a maximum independent edge set is known as the matching number or edge independence number.

blossom algorithm | edge cover | hungarian maximum matching algorithm | independence number | independent edge set | matching number | maximal independent edge set | maximum independent vertex set | perfect matching