On the Parameterized Complexity of Labelled Correlation Clustering Problem

Xianmin Liu, Jianzhong Li, Hong Gao

Abstract: The Labelled Correlation Clustering problem, a variant of Correlation Clustering problem, is defined and studied in this paper. Since the problem is NP-complete, we consider the parameterized complexities. Three different parameterizations are considered, and the corresponding parameterized complexities are studied.