\((1,1)\)-cluster editing is polynomial-time solvable (Q6048436)
From MaRDI portal
scientific article; zbMATH DE number 7737624
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((1,1)\)-cluster editing is polynomial-time solvable |
scientific article; zbMATH DE number 7737624 |
Statements
\((1,1)\)-cluster editing is polynomial-time solvable (English)
0 references
14 September 2023
0 references
cluster editing
0 references
polynomial algorithm
0 references
