Editing graphs into disjoint unions of dense clusters (Q652530)
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: Editing graphs into disjoint unions of dense clusters |
scientific article; zbMATH DE number 5988471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Editing graphs into disjoint unions of dense clusters |
scientific article; zbMATH DE number 5988471 |
Statements
Editing graphs into disjoint unions of dense clusters (English)
0 references
14 December 2011
0 references
cluster editing
0 references
parameterized complexity
0 references
data reduction
0 references
forbidden subgraph characterization
0 references
NP-hardness
0 references
clique relaxations
0 references
0.991682231426239
0 references
0.8679822683334351
0 references
0.8332167267799377
0 references
0.8255689740180969
0 references
0.8251816034317017
0 references
