Comparing recent methods in graph partitioning

In this paper we summarize some recent ideas in graph partitioning. We describe three algorithms to cluster vertices of a simple graph and we compare them according to their ability to recover classes initially introduced in random graphs.