Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs |
scientific article |
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
