Revision as of 06:38, 23 June 2014 edit AlanTonisson (talk \| contribs) 28 edits m →Blossoms and contractions: Fixed a minor grammatical mistake. ← Previous edit		Revision as of 13:45, 29 July 2014 edit undo 2.86.209.157 (talk) No edit summary Next edit →
Line 1: The '''blossom algorithm''' is an [[algorithm]] in [[graph theory]] for constructing [[maximum matching]]s on graphs. The algorithm was ~~discovered~~developed by [[Jack Edmonds]] in 1961,<ref name = "glimpse">{{Citation \| last = Edmonds \| first = Jack

Blossom algorithm: Difference between revisions