Abstract: We will discuss Karger's Algorithm, which is a simple randomized algorithm to compute the global minimum cut of a graph. Karger's algorithm is elementary, and avoids the use of maximum flows to compute the min cut.

About the Speaker: Aditi is a postdoc in the Big Data Algorithms Group at the University of Salzburg. She has done her PhD from the Computer Science Department of Rutgers University. Her research interests are in graph algorithms.

We look forward to your active participation.