On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of labeled correlation clustering problem: a parameterized complexity view |
scientific article |
Statements
On the hardness of labeled correlation clustering problem: a parameterized complexity view (English)
0 references
11 December 2015
0 references
labeled correlation clustering
0 references
parameterized complexity
0 references
lower bound
0 references
strong exponential time hypothesis
0 references
