On the Parameterized Complexity of Labelled Correlation Clustering Problem

DOI10.1007/978-3-319-08783-2_24zbMath1332.68083OpenAlexW55832546MaRDI QIDQ2920466

Xianmin Liu, Hong Gao, Jian-Zhong Li

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: On the Parameterized Complexity of Labelled Correlation Clustering Problem