Revision as of 19:51, 9 August 2016 edit 66.134.245.203 (talk) →Ambiguity in runtime explained by reference to two separate algorithms ← Previous edit		Revision as of 19:52, 9 August 2016 edit undo 66.134.245.203 (talk) →Spelling correction Next edit →
Line 55: I think the runtime with O(V*E) is achievable with a different verion of Edmond's algorithm. <small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/141.3.208.9\|141.3.208.9]] ([[User talk:141.3.208.9\|talk]]) 08:01, 11 February 2016 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot--> Perhaps it should be made more clear, but this article is on the Blossom Algorithm, not on Edmonds's Algorithm. ~~Edmond's~~Edmonds discovered both, but only the latter is commonly referred to by his name. [[Special:Contributions/66.134.245.203\|66.134.245.203]] ([[User talk:66.134.245.203\|talk]]) 19:51, 9 August 2016 (UTC)

Talk:Blossom algorithm: Difference between revisions