A polynomial-time algorithm for cluster deletion on (diamond, Butterfly)-free graphs (Q5858876)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7333438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for cluster deletion on (diamond, Butterfly)-free graphs |
scientific article; zbMATH DE number 7333438 |
Statements
14 April 2021
0 references
cluster deletion (CD)
0 references
maximal clique
0 references
(butterfly, diamond)-free graphs
0 references
polynomially solvable CD subproblem
0 references
0.9414639472961426
0 references
0.825276792049408
0 references
0.8191559910774231
0 references
0.8170031905174255
0 references
0.8135952949523926
0 references
