Editing graphs into disjoint unions of dense clusters (Q652530): Difference between revisions
From MaRDI portal
Latest revision as of 23:53, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Editing graphs into disjoint unions of dense clusters |
scientific article |
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