Arvind gave a talk about graph algorithms (breadth-first search, short-cycle decompositions, and (if time permits) random contractions).
Previous: Probability and Randomized Algorithms Problem Session
This week, we had a problem session guided by Arvind involving probability and randomized algorithms.
continue reading ❯