The Complexity Status of Problems Related to Sparsest Cuts (Q3000501)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity Status of Problems Related to Sparsest Cuts |
scientific article |
Statements
The Complexity Status of Problems Related to Sparsest Cuts (English)
0 references
19 May 2011
0 references
NP-hardness
0 references
sparsest cut
0 references
densest cut
0 references
MSSC
0 references
bounded treewidth
0 references
0 references
0 references
0 references
