Revision as of 14:44, 14 August 2012 edit Bender2k14 (talk \| contribs) Extended confirmed users 1,999 edits m intro: improved formatting (this minor quote should be inline IMO) ← Previous edit		Revision as of 14:46, 14 August 2012 edit undo Bender2k14 (talk \| contribs) Extended confirmed users 1,999 edits m →Bipartite matching: removed an extra space Next edit →
Line 177: ===Bipartite matching=== The algorithm reduces to the standard algorithm for matching in bipartite graphs <ref name = "karp notes"/> when ''G'' is [[bipartite graph\|bipartite]]. As there are no odd cycles in ''G'' in that case, blossoms will never be found and one can simply remove lines B21 – B29 of the algorithm. ===Weighted matching===

Blossom algorithm: Difference between revisions