Computing maximum \(k\)-defective cliques in massive graphs (Q2026994)
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: Computing maximum \(k\)-defective cliques in massive graphs |
scientific article; zbMATH DE number 7350527
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing maximum \(k\)-defective cliques in massive graphs |
scientific article; zbMATH DE number 7350527 |
Statements
Computing maximum \(k\)-defective cliques in massive graphs (English)
0 references
21 May 2021
0 references
relaxed clique
0 references
exact search
0 references
branch-and-bound
0 references
massive graphs
0 references
graph reduction
0 references
0 references
0 references
0.88756824
0 references
0.8859435
0 references
0.88171643
0 references
0.8799151
0 references
0.87822366
0 references
0.87684345
0 references
