Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight bounds for parameterized complexity of cluster editing with a small number of clusters |
scientific article; zbMATH DE number 6302138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for parameterized complexity of cluster editing with a small number of clusters |
scientific article; zbMATH DE number 6302138 |
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
0 references
0.9496996998786926
0 references
0.8411777019500732
0 references
0.8326645493507385
0 references
0.8262562155723572
0 references
0.8239101767539978
0 references
