Curitiba Pr

CPGEI. (2007)

Av. De Setembro, Heitor S. Lopes, Curitiba Pr, Alex A. Freitas

An important issue in data mining is scalability with respect to the size of the dataset being mined. In the paper we address this issue by presenting a parallel GA for rule discovery. This algorithm...

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....