Skip to main content
SpringerLink
Log in

Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We present efficient fixed-parameter algorithms for the NP-complete 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.27k + |V|3) time; allowing only up to k edge deletions (Cluster Deletion), we solve this problem in O(1.77k + |V|3) time. The key ingredients of our algorithms are two easy to implement bounded search tree algorithms and an efficient polynomial-time reduction to a problem kernel of size O(k3). This improves and complements previous work. Finally, we discuss further improvements on search tree sizes using computer-generated case distinctions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut fur Informatik, Universitat Tubingen, Sand 13, D-72076 Tubingen, Germany

    Jens Gramm

  2. Institut fur Informatik, Friedrich-Schiller-Universitat Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany

    Jiong Guo, Falk Hüffner & Rolf Niedermeier

Authors
  1. Jens Gramm
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Falk Hüffner
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rolf Niedermeier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jens Gramm, Jiong Guo, Falk Hüffner or Rolf Niedermeier.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gramm, J., Guo, J., Hüffner, F. et al. Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory Comput Syst 38, 373–392 (2005). https://doi.org/10.1007/s00224-004-1178-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-004-1178-y

Keywords

Search

Navigation