Explore relationships

Maximum-weight matching

Maximum-weight matching is an optimization problem in graph theory in which the goal is to find a matching of maximum possible total weight in an edge-weighted graph.

Use + to expand a branch. Click a topic name to open its summary.