There are many interconnections between the yellow cluster and the pink cluster. The seed paper in the yellow cluster treats about wavelets and wavelets is a common tool used in computer graphics (the pink cluster). Another observation that we can make is that a certain number of nodes are very highly connected and link to many different clusters.

The computational complexity of the algorithm is , where is the number of seeds, is the number of iterations of the eigenvector algorithm and is the number of edges in the graph. Uniformly random walk is more efficient than the algorithm that in [15], with complexity , but does not guarantee contiguity.

Ali Salehi 2005-04-29