On maximum degree-based \(\gamma\)-quasi-clique problem: complexity and exact approaches (Q4565788)
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: On maximum degree-based -quasi-clique problem: complexity and exact approaches |
scientific article; zbMATH DE number 6887387
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On maximum degree-based \(\gamma\)-quasi-clique problem: complexity and exact approaches |
scientific article; zbMATH DE number 6887387 |
Statements
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (English)
0 references
13 June 2018
0 references
degree-based quasi-clique
0 references
quasi-clique
0 references
\(k\)-core
0 references
clique
0 references
clique relaxation
0 references
branch-and-bound
0 references
mixed integer programming
0 references
0.8895998001098633
0 references
0.8673397898674011
0 references
0.8141477108001709
0 references
0.8126594424247742
0 references
0.7881232500076294
0 references
