Latapy et al. show an algorithm for discovering the community
structure of a complex networks. Their approach differs from ours in that
they don't make any assumptions on prior knowledge about the
graph and in our case we have the starting seed nodes as
additional input. Moreover, what they consider is hierarchical clustering
while our goal is to divide the graph into a fixed number of
non-overlapping components .