1. A method in a computing device for clustering objects having relationships, the method comprising: generating an original Laplacian matrix representation of a graph with vertices representing the objects and edges representing the relationships; applying an eigenvalue decomposition solver to the original Laplacian matrix for a number of iterations; identifying stable elements of an eigenvector resulting from the applying of the solver; aggregating elements of the original Laplacian matrix corresponding to the identified stable elements; generating a compressed Laplacian matrix from the aggregated elements and elements of the original Laplacian matrix corresponding to the elements not identified as stable; and applying an eigenvalue decomposition solver to the compressed Laplacian matrix to arrive at a solution wherein the resulting eigenvector represents a clustering of the objects.