Content deleted Content added
m Open access bot: doi updated in citation with #oabot. |
Added |
||
| (4 intermediate revisions by 3 users not shown) | |||
Line 200:
===Weighted matching===
The matching problem can be generalized by assigning weights to edges in {{mvar|G}} and asking for a set {{mvar|M}} that produces a matching of maximum (minimum) total weight: this is the [[maximum weight matching]] problem. This problem can be solved by a combinatorial algorithm that uses the unweighted Edmonds's algorithm as a subroutine.<ref name = "matching book"/> Vladimir Kolmogorov provides an efficient C++ implementation of this.<ref name = blossom5>{{citation
| author = Kolmogorov, Vladimir
| title = Blossom V: A new implementation of a minimum cost perfect matching algorithm
| |||