Maximum weight matching
id:
maximum-weight-matching-243-17159384
title:
Maximum weight matching
text:
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. A special case of it is the assignment problem, in which the input is restricted to be a bipartite graph, and the matching constrained to be have cardinality that of the smaller of the two partitions. Another special case is the problem of finding a maximum cardinality matching on an unweighted graph: this corresponds to th
brand slug:
wiki
category slug:
encyclopedia
description:
Graph theory problem: find a matching with max total weight
original url:
https://en.wikipedia.org/wiki/Maximum_weight_matching
date created:
date modified:
2024-04-21T22:59:38Z
main entity:
{"identifier":"Q65088750","url":"https://www.wikidata.org/entity/Q65088750"}
image:
fields total:
13
integrity:
14