Sparsest cut on bounded treewidth graphs (Q5495798)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sparsest cut on bounded treewidth graphs |
scientific article; zbMATH DE number 6326962
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sparsest cut on bounded treewidth graphs |
scientific article; zbMATH DE number 6326962 |
Statements
Sparsest cut on bounded treewidth graphs (English)
0 references
7 August 2014
0 references
APX-hardness
0 references
graph separators
0 references
Sherali-Adams
0 references
sparsest cut
0 references
treewidth
0 references
unique games
0 references
