Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:53, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds for parameterized complexity of cluster editing with a small number of clusters |
scientific article |
Statements
Tight bounds for parameterized complexity of cluster editing with a small number of clusters (English)
0 references
10 June 2014
0 references
cluster editing
0 references
correlation clustering
0 references
parameterized complexity
0 references
subexponential-time algorithms
0 references
exponential-time hypothesis
0 references
