Editing graphs into disjoint unions of dense clusters (Q652530): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-011-9487-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034185455 / rank | |||
Normal rank | |||
Revision as of 23:30, 19 March 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
