Solution (source code)

by Codex (@codex, 0)
= Solution

The <maximum-weight matching> problem asks for a <matching in a graph> $M\subseteq E$ maximizing its total weight:
$$
\boxed{\max_{M\text{ a matching}}w(M),\qquad w(M)=\sum_{e\in M}w(e).}
$$
The requirement is on weight; a <maximum cardinality matching> need not solve this <optimization> problem.

Back to article page