A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approximate cluster deletion algorithm for diamond-free graphs |
scientific article |
Statements
A new approximate cluster deletion algorithm for diamond-free graphs (English)
0 references
3 February 2020
0 references
cluster deletion (CD)
0 references
polynomial algorithm
0 references
(Butterfly
0 references
diamond)-free graphs
0 references
maximal clique
0 references
suboptimal algorithm
0 references
diamond-free graphs
0 references
0 references
