Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree

@article{Saha2006DynamicAF,
  title={Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree},
  author={Barna Saha and Pabitra Mitra},
  journal={Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)},
  year={2006},
  pages={667-671}
}
In this paper we introduce a dynamic algorithm for clustering undirected graphs, whose edge property is continuously changing. The algorithm can maintain high-quality clusters efficiently in presence of insertion and deletion (update) of edges. The algorithm is motivated by the minimum-cut tree based partitioning algorithm presented in G. W. Flake et al. (2004) and G. W. Flake (2000). It takes O(k3) time for each update processing, where k is the maximum size of any cluster. This is the worst… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Dynamic Algorithm for Graph Clustering, http://home.iitk.ac.in/∼barna/dc.pdf

B. Saha, P. Mitra
Sixth IEEE International Conference on Data Mining - Workshops • 2006
View 4 Excerpts
Highly Influenced

Graph Clustering and Minimum Cut Trees

View 8 Excerpts
Highly Influenced

Dynamic algorithm for graph clustering using minimum cut tree

Barna Saha, Pabitra Mitra
ICDM Workshops , pages • 2006

On clusteringsgood, bad and spectral

R. Kannan, S. Vempala, A. Veta
FOCS ’00:, page 367, • 2000
View 2 Excerpts

Multi-terminal network flows

R. E. Gomory, T. C. Hu
J-SIAM, 9(4):551–570, December • 1961
View 2 Excerpts

Similar Papers

Loading similar papers…