Dynamic Graph Clustering Using Minimum-Cut Trees

  • Robert Görke
  • Tanja Hartmann
  • Dorothea Wagner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5664)

Abstract

Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering algorithm by Flake et al. does however yield such a provable guarantee. We show that the structure of minimum-s-t-cuts in a graph allows for an efficient dynamic update of minimum-cut trees, and present a dynamic graph clustering algorithm that maintains a clustering fulfilling this quality quarantee, and that effectively avoids changing the clustering. Experiments on real-world dynamic graphs complement our theoretical results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Robert Görke
    • 1
  • Tanja Hartmann
    • 1
  • Dorothea Wagner
    • 1
  1. 1.Faculty of InformaticsUniversität Karlsruhe (TH), Karlsruhe Institute of Technology (KIT)Germany

Personalised recommendations