Keywords

#maximum_weight_matching

Maximum weight matching

Graph theory problem: find a matching with max total weight

In computer science and graph theory, the maximum weight matching problem is the problem of finding, in a weighted graph, a matching in which the sum of weights is maximized.

Sun 21st

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Maximum weight matching Matching (graph theory) Maximum cardinality matching Assignment problem Bipartite graph Matroid intersection Auction algorithm Assignment valuation Maximum flow problem Round-robin item allocation
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.