On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155): Difference between revisions

@@ Property / author @@
+Jian-Zhong Li
@@ Property / author: Jian-Zhong Li / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2015.03.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2007201646
@@ Property / OpenAlex ID: W2007201646 / rank @@
+Normal rank
@@ Property / cites work @@
+Correlation clustering
@@ Property / cites work: Correlation clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Aggregating inconsistent information
@@ Property / cites work: Aggregating inconsistent information / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering with qualitative information
@@ Property / cites work: Clustering with qualitative information / rank @@
+Normal rank
@@ Property / cites work @@
+Correlation clustering in general weighted graphs
@@ Property / cites work: Correlation clustering in general weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and complexity results for labeled correlation clustering problem
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Q4281497
@@ Property / cites work: Q4281497 / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of some minimum label problems
+Normal rank
@@ Property / cites work @@
+Local search for the minimum label spanning tree problem with bounded color classes.
+Normal rank
@@ Property / cites work @@
+Approximation algorithms and hardness results for labeled connectivity problems
+Normal rank
@@ Property / cites work @@
+Q4659605
@@ Property / cites work: Q4659605 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952637
@@ Property / cites work: Q4952637 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and hardness results for label cut and related problems
+Normal rank
@@ Property / cites work @@
+Q3003675
@@ Property / cites work: Q3003675 / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank