Solving the minimum cut problem for undirected graphs

A recent publication introduces a near-linear running time deterministic algorithm for solving the minimum cut problem in weighted graphs. The algorithm settles the optimal complexity for the problem and has applications in various fields.