\((1,1)\)-cluster editing is polynomial-time solvable (Q6048436)
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: (1,1)-cluster editing is polynomial-time solvable |
scientific article; zbMATH DE number 7737624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.804568886756897
0 references
0.803433358669281
0 references
0.8030872344970703
0 references
0.7989578247070312
0 references
0.7982174754142761
0 references
