We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...