Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864)
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 6577334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs |
scientific article; zbMATH DE number 6577334 |
Statements
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (English)
0 references
4 May 2016
0 references
quasi-clique
0 references
\(s\)-defective clique
0 references
average \(s\)-plex
0 references
dense subgraph
0 references
clique relaxation
0 references
mixed integer programming
0 references
0 references
0 references
0.8964666128158569
0 references
0.8735666275024414
0 references
0.8673397898674011
0 references
0.8436636924743652
0 references
0.8369676470756531
0 references
