Blossom algorithm: Difference between revisions

Content deleted Content added
Changed run time complexity from |V|^4 to |E||V|^2, the complexity proof can be found in Edmonds work or any typical paper about this algorithm.
m top: task, replaced: Canad. J. → Can. J. using AWB
Line 13:
| author = Edmonds, Jack
| title = Paths, trees, and flowers
| journal = CanadCan. J. Math.
| volume = 17
| year = 1965