NETtalk #11 - Karger's Algorithm

Description: A randomized algorithm to find the minimum cut in a graph.

From student speaker Arkady Arkhangorodsky:
"My favourite algorithm – a gentle introduction to graph theory and randomized algorithms through Karger’s minimum cut algorithm."

"it’s a shame it doesn’t come up often enough in programming classes, because it’s very unique and elegant in its use of randomness."

Date: 2016-02-09

Start Time: 08:00 pm EST

Finish Time: 09:00 pm EST