Tight bounds for parameterized complexity of Cluster Editing (Q2957869)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6678906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds for parameterized complexity of Cluster Editing |
scientific article; zbMATH DE number 6678906 |
Statements
30 January 2017
0 references
parameterized complexity
0 references
cluster editing
0 references
correlation clustering
0 references
subexponential algorithms
0 references
tight bounds
0 references
Tight bounds for parameterized complexity of Cluster Editing (English)
0 references
0.9887617
0 references
0.96152294
0 references
0.93913686
0 references
0.9241465
0 references
0.9217515
0 references
0.9215729
0 references
0.9215729
0 references
0.92077327
0 references
0.91857386
0 references
0.9137085
0 references
