Approximation and hardness results for the max \(k\)-uncut problem (Q1630990)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and hardness results for the max \(k\)-uncut problem |
scientific article |
Statements
Approximation and hardness results for the max \(k\)-uncut problem (English)
0 references
5 December 2018
0 references
max \(k\)-uncut
0 references
densest \(k\)-subgraph
0 references
homophily
0 references
approximation algorithm
0 references
computational complexity
0 references
0 references
0 references
0 references
