Blossom algorithm: Difference between revisions

Content deleted Content added

Revision as of 02:21, 12 October 2024 edit JJMC89 bot III (talk \| contribs) Bots, Administrators 4,339,123 edits m Moving Category:Graph algorithms to Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms Tag: Reverted ← Previous edit		Latest revision as of 17:29, 27 August 2025 edit undo Alexander.shen (talk \| contribs) 4 edits Added
(3 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 Line 215: <references/> [[Category:~~Algorithms~~Graph ~~in graph theory~~algorithms]] [[Category:Matching (graph theory)]]