Revision as of 05:07, 17 January 2014 edit Mark viking (talk \| contribs) Extended confirmed users 19,327 edits Seems beyond start class, bumping it to C class ← Previous edit		Revision as of 08:01, 11 February 2016 edit undo 141.3.208.9 (talk) →Ambiguity in runtime: new section Next edit →
Line 48: Reference 6 is access restricted for unregistered users. Finding a non-restricted source would be appreciated. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/190.44.82.18\|190.44.82.18]] ([[User talk:190.44.82.18\|talk]]) 18:14, 24 November 2012 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot--> == Ambiguity in runtime == In the section for general graphs, the runtime of Edmond's algorithm is stated to be O(VE). The article on Edmond's algorithm however states that it needs O(V^4) time. I think the runtime with O(VE) is achievable with a different verion of Edmond's algorithm.

Talk:Blossom algorithm: Difference between revisions