Abstract
The literature is vast in algorithms to approach the graph partitioning problem. Algorithms based on the spectral relaxation of several formulations of this problem are knownas spectral clustering heuristics, algorithms conceptually elegant and that achieve satisfactory results. The computational cost of these algorithms, however, oftentimes makesthem impracticable to deal with large scal…