,
Takuro Fukunaga
Creative Commons Attribution 4.0 International license
Chromatic correlation clustering (CCC) is the problem of transforming a given edge-colored undirected graph into a disjoint union of monochromatic cliques using at most k edge modifications (edge additions, deletions, or recolorings). This problem generalizes the cluster editing problem, which has been extensively studied in the field of parameterized algorithms. Both CCC and cluster editing are NP-hard, and both are fixed-parameter tractable with respect to k. The fastest known algorithm for CCC runs in O^*(1.92^k) time. We present a new parameterized algorithm for CCC with running time O^*(1.62^k), matching the best known running time for cluster editing. The key idea of our algorithm is to generalize CCC to a nontrivial weighted variant. We adapt several branching rules from the current best algorithm for cluster editing to weighted CCC; however, these rules do not cover all the cases that arise in CCC. By augmenting them with new branching rules specific to CCC, we obtain our improved algorithm.
@InProceedings{oowa_et_al:LIPIcs.IPEC.2026.17,
author = {Oowa, Kensuke and Fukunaga, Takuro},
title = {{Weighted Chromatic Correlation Clustering and a Parameterized Algorithm}},
booktitle = {21st International Symposium on Parameterized and Exact Computation (IPEC 2026)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-456-7},
ISSN = {1868-8969},
year = {2026},
volume = {398},
editor = {Korhonen, Tuukka and Lampis, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2026.17},
URN = {urn:nbn:de:0030-drops-281901},
doi = {10.4230/LIPIcs.IPEC.2026.17},
annote = {Keywords: chromatic correlation clustering, cluster editing, graph algorithms, parameterized algorithms}
}