matching algorithm by R. Preis (STACS'99).
Then Kurt will present the Stoer-Wagner algorithm for computing minimum cuts in
undirected networks (LEDAbook, chapter on graph algorithms, section
mincut). He will also show how to compute a correctness certificate
for the algorithm (http://www.mpi-sb.mpg.de/~mehlhorn/ftp/mincut.ps).