The complexity status of problems related to sparsest cuts (Q3000501)
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 5897206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity status of problems related to sparsest cuts |
scientific article; zbMATH DE number 5897206 |
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
0.8678157329559326
0 references
0.8435205221176147
0 references
0.8088937401771545
0 references
0.8067665696144104
0 references
0.8034575581550598
0 references
