Computing the Minimum Cut and Maximum Flow of Undirected Graphs (2004)
Jonatan Schroeder, Andr'e Pires Guedeselias, P. Duarte, Curitiba Pr, Jonatan Schroeder, Andr'e Pires Guedes
Abstract This work presents an algorithm for computing the maximum flow and minimum cut of undirected graphs, based on the well-known algorithm presented by Ford and Fulkerson for directed graphs....