Finding the global minimum cut: Flows beat PageRank

by · Mar 23, 2017 · 292 views ·

Pražský informatický seminář

In this talk we will survey the history and the state of the art of algorithms for finding minimum cuts in graphs, including some new developments. We will focus on global minimum cuts, which is the minimum of s-t cuts over all pairs of vertices s and t.