Sparsest cut on bounded treewidth graphs (Q5495798): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1305.1347 / rank | |||
Normal rank | |||
Latest revision as of 02:32, 20 April 2024
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
