| Article ID: | iaor200944744 |
| Country: | France |
| Volume: | 42 |
| Issue: | 4 |
| Start Page Number: | 469 |
| End Page Number: | 484 |
| Publication Date: | Oct 2008 |
| Journal: | RAIRO Operations Research |
| Authors: | Gunoche Alain |
We first describe four recent methods to cluster vertices of an undirected non weighted connected graph. They are all based on very different principles. The fifth is a combination of classical ideas in optimization applied to graph partitioning. We compare these methods according to their ability to recover classes initially introduced in random graphs with more edges within the classes than between them.