Article ID Journal Published Year Pages File Type
9514532 Electronic Notes in Discrete Mathematics 2005 7 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Comparing recent methods in graph partitioning
Authors
,