Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation

@inproceedings{Gramm2003GraphModeledDC,
  title={Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation},
  author={Jens Gramm and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier},
  booktitle={CIAC},
  year={2003}
}
We present efficient fixed-parameter algorithms for the NPcomplete edge modification problems Cluster Editing and Cluster Deletion. Here, the goal is to make the fewest changes to the edge set of an input graph such that the new graph is a vertex-disjoint union of cliques. Allowing up to k edge additions and deletions (Cluster Editing), we solve this problem in O(2.27 + |V |) time; allowing only up to k edge deletions (Cluster Deletion), we solve this problem in O(1.77 + |V |) time. The key… CONTINUE READING