Content deleted Content added
Bender2k14 (talk | contribs) m →Bipartite matching: removed an extra space |
Bender2k14 (talk | contribs) m →Analysis: removed an extra space |
||
Line 165:
** every exposed vertex in ''G'' is a root of an alternating tree in ''F''.
Each iteration of the loop starting at line B09 either adds to a tree ''T'' in ''F'' (line B10) or finds an augmenting path (line B17) or finds a blossom (line B21). It is easy to see that the running time is <math>O( |V|^4 )</math>. Micali and Vazirani
| author1 = Micali, Silvio
| author2 = Vazirani, Vijay
| |||