Shortest paths, maximum flows and the max-flow/min-cut theorem

Arjun Krishnan

Thursday, June 11th, 2020
6:30 PM - 8:00 PM
Zoom ID 573 239 4086

(CoronaVirus Lecture Series)

I will review a few common algorithms (Dijkstra, Bellman-Ford, Ford-Fulkerson) that solve the shortest path and maximum flow problems on graphs and prove their correctness. Then I’ll prove the max-flow/min-cut duality theorem.

The .pdf file and the video of the talk will be posted on the CoronaVirus Lecture Series Page:

Event contact: iosevich at gmail dot com