Algorithm

We're getting close to an algorithm.


\begin{algorithm} {Bipartite-Match}{G} M \= \emptyset \\ p \= \mbox{\sc Augmenti... ... \\ p \= \mbox{\sc Augmenting-Path}(G,M)\end{WHILE} \\ \RETURN M\end{algorithm}

Will get a matching that's maximal-plus-plus. But, there are still some unanswered questions. Like?

next up previous
Next: Cuts Up: MIN-CUT MAX-FLOW Previous: Augmenting Path Facts