Computing the Minimum Cut and Maximum Flow of Undirected Graphs. Schroeder, J., Guedes, A. L. P., & Jr., E. P. D. Technical Report RT-DINF 003/2004, Departamento de Informática - UFPR, 2004.
Computing the Minimum Cut and Maximum Flow of Undirected Graphs [pdf]Pdf  bibtex   

Downloads: 0