Revision as of 09:12, 4 April 2020 edit A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,578 edits →Bipartite matching: rewrite, clarify "standard algorithm" Tag: 2017 wikitext editor ← Previous edit		Revision as of 10:25, 4 April 2020 edit undo A3nm (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,578 edits →Weighted matching: point to maximum weight matching Tag: 2017 wikitext editor Next edit →
Line 195: ===Weighted matching=== The matching problem can be generalized by assigning weights to edges in ''G'' and asking for a set ''M'' that produces a matching of maximum (minimum) total weight.: ~~The~~this ~~weighted~~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"/> 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

Blossom algorithm: Difference between revisions