Skip to main content

Project: Max-Flow Min-Cut Theorem with Dynamic Trees

Mentors: Lorenzo Orecchia, Department of Computer Science

Research Area Keywords: Machine Learning // Algorithms & Optimization // Computer Science Theory

Project Description: Andrew Razborov is a junior at the University of Chicago Laboratory Schools. This summer, he worked with Prof. Lorenzo Orecchia and Konstantinos Ameranis on a project working to solve the max flow, min cut problem using dynamic trees, which maintain paths from the root to the source as a forest of vortex disjoint trees.

Watch Andrew’s Final Video

arrow-left-smallarrow-right-large-greyarrow-right-large-yellowarrow-right-largearrow-right-long-yellowarrow-right-smallfacet-arrow-down-whitefacet-arrow-downCheckedCheckedlink-outmag-glass