By Topic

Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Saha, B. ; Indian Inst. of Technol., Kanpur ; Mitra, P.

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 case time complexity, and in general time taken is much less. To the best of our knowledge, this is the first clustering algorithm, for evolving graphs, providing strong theoretical quality guarantee on clusters

Published in:

Data Mining Workshops, 2006. ICDM Workshops 2006. Sixth IEEE International Conference on

Date of Conference:

Dec. 2006