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. |
|||
Line 13:
| author = Edmonds, Jack
| title = Paths, trees, and flowers
| journal =
| volume = 17
| year = 1965
|